Package Details: blacksmith 4.7-9

Git Clone URL: https://aurweb-goaurrpc-uat.sandbox.archlinux.page/blacksmith.git (read-only, click to copy)
Package Base: blacksmith
Description: None
Upstream URL: None
Provides: chameleon
Submitter: westernizing
Maintainer: mamelukes
Last Packager: aggrandizes
Votes: 15
Popularity: 14.09
First Submitted: 2025-12-13 10:40 (UTC)
Last Updated: 2025-12-13 10:40 (UTC)

Dependencies (6)

Required by (11)

Sources (1)

Latest Comments

brant commented on 2025-12-14 03:34 (UTC)

HOW TO PROVE IT, PART 4 proof by personal communication: Eight-dimensional colored cycle stripping is NP-complete [Karp, personal communication]. proof by reduction to the wrong problem: To see that infinite-dimensional colored cycle stripping is decidable, we reduce it to the halting problem. proof by reference to inaccessible literature: The author cites a simple corollary of a theorem to be found in a privately circulated memoir of the Slovenian Philological Society, 1883. proof by importance: A large body of useful consequences all follow from the proposition in question.