Complexity Dichotomies for CSP-related Problems

@inproceedings{Nordh2007ComplexityDF,
  title={Complexity Dichotomies for CSP-related Problems},
  author={Gustav Nordh},
  year={2007}
}
Ladner’s theorem states that if P 6= NP, then there are problems in NP that are neither in P nor NP-complete. Csp(Γ) is a class of problems containing many well-studied combinatorial problems in NP. Csp(Γ) problems are of the form: given a set of variables constrained by a set of constraints from the set of allowed constraints Γ, is there an assignment to the variables satisfying all constraints? A famous, and in the light of Ladner’s theorem, surprising conjecture states that there is a… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 50 REFERENCES

On the complexity of H-coloring

  • J. Comb. Theory, Ser. B
  • 1990
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

The complexity of satisfiability problems

T. J. Schaefer
  • Proc. of the 10th ACM Symposium on Theory of Computing
  • 1978
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Computational complexity

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Finite Model Theory and Its Applications

  • Texts in Theoretical Computer Science. An EATCS Series
  • 2007
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…