Non-dichotomies in Constraint Satisfaction Complexity

@inproceedings{Bodirsky2008NondichotomiesIC,
  title={Non-dichotomies in Constraint Satisfaction Complexity},
  author={Manuel Bodirsky and Martin Grohe},
  booktitle={ICALP},
  year={2008}
}
We show that every computational decision problem is polynomialtime equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem L an ω-categorical template Γ such that L reduces to CSP(Γ ) and CSP(Γ ) is in coNP (i.e., the class coNP with an oracle for L). CSPs with ω-categorical templates are of special interest, because the universal-algebraic approach can be applied to study their computational complexity. Furthermore, we… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 33 CITATIONS

Decomposing Quantified Conjunctive (or Disjunctive) Formulas

  • 2012 27th Annual IEEE Symposium on Logic in Computer Science
  • 2012
VIEW 20 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Understanding the Complexity of Induced Subgraph Isomorphisms

VIEW 4 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

Similar Papers

Loading similar papers…