Skip to main content
SpringerLink
Log in

The property of being polynomial for Mal’tsev constraint satisfaction problems

  • Published:
Algebra and Logic Aims and scope

Abstract

A combinatorial constraint satisfaction problem aims at expressing in unified terms a wide spectrum of problems in various branches of mathematics, computer science, and AI. The generalized satisfiability problem is NP-complete, but many of its restricted versions can be solved in a polynomial time. It is known that the computational complexity of a restricted constraint satisfaction problem depends only on a set of polymorphisms of relations which are admitted to be used in the problem. For the case where a set of such relations is invariant under some Mal’tsev operation, we show that the corresponding constraint satisfaction problem can be solved in a polynomial time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. K. Mackworth, “Consistency in networks of relations,” Art. Int., 8, 99–118 (1977).

    Article  Google Scholar 

  2. T. J. Schaefer, “The complexity of satisfiability problems,” in Proc. 10th ACM Symp. Theory Comp., STOC’78 (1978), pp. 216–226.

  3. T. Feder and M. Y. Vardi, “The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory,” SIAM J. Comp., 28, No. 1, 57–104 (1998).

    Article  MathSciNet  Google Scholar 

  4. P. G. Jeavons, D. A. Cohen, and M. Gyssens, “Closure properties of constraints,” J. ACM, 44, No. 4, 527–548 (1997).

    Article  MathSciNet  Google Scholar 

  5. P. Jeavons, “On the algebraic structure of combinatorial problems,” Theor. Comp. Sc., 200, Nos. 1/2, 185–204 (1998).

    Article  MathSciNet  Google Scholar 

  6. A. A. Bulatov, P. G. Jeavons, and A. A. Krokhin, “Constraint satisfaction problems and finite algebras,” in Automata, Languages and Programming, 27th Int. Coll., Lect. Notes Comp. Sc., Vol. 1853, Springer-Verlag, Berlin (2000), pp. 272–282.

    Google Scholar 

  7. A. A. Bulatov and P. G. Jeavons, “Algebraic approach to multi-sorted constraints,” Techn. Report PRG-RR-01-18, Comp. Lab., Oxford Univ. (2001).

  8. T. Feder, “Constraint satisfaction on finite groups with near subgroups,” submitted to J. Alg.

  9. A. A. Bulatov and P. G. Jeavons, “An algebraic approach to multi-sorted constraints,” in Proc. CP’03 (2003), pp. 197–202.

  10. A. A. Bulatov and P. G. Jeavons, “Algebraic structures in combinatorial problems,” Techn. Report MATH-AL-4-2001, Dresden Techn. Univ. (2001).

  11. A. A. Bulatov, P. G. Jeavons, and A. A. Krokhin, “Classifying complexity of constraints using finite algebras,” SIAM J. Comp., 34, No. 3, 720–742 (2005).

    Article  MathSciNet  Google Scholar 

  12. D. Hobby and R. N. McKenzie, The Structure of Finite Algebras, Cont. Math., Vol. 76, AMS, Providence (1988).

    Google Scholar 

  13. A. A. Bulatov, “Three-element Mal’tsev algebras,” to appear in Acta Sc. Math.

Download references

Author information

Authors and Affiliations

  1. Ural State University, Ekaterinburg, Russia

    A. A. Bulatov

Authors
  1. A. A. Bulatov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

__________

Translated from Algebra i Logika, Vol. 45, No. 6, pp. 655–686, November–December, 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bulatov, A.A. The property of being polynomial for Mal’tsev constraint satisfaction problems. Algebr Logic 45, 371–388 (2006). https://doi.org/10.1007/s10469-006-0035-2

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-006-0035-2

Keywords

Search

Navigation