Construct · 1 fields · 1 citations

Schaefer's dichotomy theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Schaefer'sdichotomy theorem1 CONSTRUCTSchaefer's dichotomySCHAEFER · COMPUTATIONAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the result that every Boolean constraint satisfaction problem is either solvable in polynomial time or NP-complete, with the easy cases listed.

In computational complexity, Schaefer's dichotomy theorem refers to the result that every Boolean constraint satisfaction problem is either solvable in polynomial time or NP-complete, with the easy cases listed. This meaning comes from Schaefer (1978) in Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Schaefer's dichotomy theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructsconstraint satisfaction problem1 fields · 1 citationsanchor · a standalone constructsatisfaction5 fields · 11 citationsjingle · one name, five constructs

References

  1. Schaefer, T. J. (1978). The complexity of satisfiability problems. Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. https://doi.org/10.1145/800133.804350

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct