The Optimization Complexity of Constraint Satisfaction Problems


In 1978, Schaefer [12] considered a subclass of languages in NP and proved a “dichotomy theorem” for this class. The subclass considered were problems expressible as “constraint satisfaction problems”, and the “dichotomy theorem” showed that every language in this class is either in P, or is NP-hard. This result is in sharp contrast to a result of Ladner [9… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics