Construct · 1 fields · 1 citations

CSP dichotomy theorem: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
CSP dichotomytheorem1 CONSTRUCTCSP dichotomy theoremFEDER · 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 claim, conjectured by Feder and Vardi and later proved, that every finite-template constraint satisfaction problem is either polynomial or NP-complete.

In computational complexity, CSP dichotomy theorem refers to the claim, conjectured by Feder and Vardi and later proved, that every finite-template constraint satisfaction problem is either polynomial or NP-complete. This meaning comes from Feder (1998) in SIAM Journal on Computing.[1]

Unit
Recovery means
Measured by

Next

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

See how CSP 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. Feder, T., & Vardi, M. Y. (1998). The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM Journal on Computing, 28(1), 57-104. https://doi.org/10.1137/s0097539794266766

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