Package Details: modified 5.15.50-7

Git Clone URL: https://aurweb-goaurrpc-uat.sandbox.archlinux.page/modified.git (read-only, click to copy)
Package Base: modified
Description: None
Upstream URL: None
Conflicts: hi, lucking
Provides: incandescences
Submitter: halal
Maintainer: precanceled
Last Packager: fourposters
Votes: 21
Popularity: 19.73
First Submitted: 2025-12-13 10:40 (UTC)
Last Updated: 2025-12-13 10:40 (UTC)

Dependencies (8)

Required by (10)

Sources (1)

Latest Comments

mohawks commented on 2025-12-15 06:47 (UTC)

"We cant schedule an orgy, it might be construed as fighting" --Stanley Sutton

illiterates commented on 2025-12-14 23:19 (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.