Computers and Intractability

Michael R Garey, D. S. J. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness.

Type

Unclassified

Intellectual base

Unclassified

Year

1979

Link

no authoritative link yet

Cited by

3 citations across 3 artifacts.

Domain-specific

• Monochromatic triangle
  • The two-color version asks whether edges can be partitioned into two triangle-free subgraphs, is NP-complete in general and becomes tractable under bounded structural parameters such as treewidth.
• Nondeterministic Turing machine
  • Nondeterminism does not expand computable languages over deterministic Turing machines, but polynomial-time simulation cost motivates NP and complexity questions; branch and halting conventions must be stated.
• Set splitting problem
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:68229dabcdbc · see in the full table