Classifying the Complexity of Constraints Using Finite Algebras

@article{Bulatov2005ClassifyingTC,
  title={Classifying the Complexity of Constraints Using Finite Algebras},
  author={Andrei A. Bulatov and Peter Jeavons and Andrei A. Krokhin},
  journal={SIAM J. Comput.},
  year={2005},
  volume={34},
  pages={720-742}
}
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and we explore how the computational complexity of the corresponding constraint satisfaction problem is connected to the… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 385 CITATIONS, ESTIMATED 96% COVERAGE

Constraint satisfaction problems: complexity and algorithms

  • SIGLOG News
  • 2018
VIEW 4 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Descriptive complexity of constraint problems

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

The wonderland of reflections

VIEW 9 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

A Dichotomy Theorem for Nonuniform CSPs

  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Asking the Metaquestions in Constraint Tractability

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs

  • ACM Trans. Comput. Log.
  • 2017
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Graphs of relational structures: restricted types

  • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems

  • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2004
2019

CITATION STATISTICS

  • 75 Highly Influenced Citations

  • Averaged 29 Citations per year from 2017 through 2019

References

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

The complexity of satisfiability problems

T. Schaefer
  • Proceedings of the 10th ACM Symposium on Theory of Computing (STOC’78)
  • 1978
VIEW 23 EXCERPTS
HIGHLY INFLUENTIAL

Tractable conservative constraint satisfaction problems

  • 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
  • 2003
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A dichotomy theorem for constraints on a three-element set

  • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

On the Algebraic Structure of Combinatorial Problems

  • Theor. Comput. Sci.
  • 1998
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Computational complexity

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Algebras

R. McKenzie, G. McNulty, W. Taylor
  • Lattices and Varieties, Vol. I, Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, CA
  • 1987
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL