Taylor terms, constraint satisfaction and the complexity of polynomial equations over finite algebras

International Journal of Algebra and Computation

Volumn 16, Issue 3, 2006, Pages 563-581

  Larose, Benoit ^a   Zádori, László ^b  

^a Dept of Electrical and Computer Engineering   (Canada)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

Complexity; Constraint satisfaction; Systems of polynomial equations; Varieties

Indexed keywords

EID: 33745606241     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218196706003116     Document Type: Article

References (45)

1. K. A. Baker and A. F. Pixley, Polynomial interpolation and the Chinese remainder theorem for algebraic systems, Math. Z. 143(2) (1975) 165-174.
2. A. Bulatov, A dichotomy theorem for constraints on a three-element set, in Proc. 43rd IEEE Symposium on Foundations of Computer Science (FOCS'02), Vancouver, Canada (2002), pp. 649-658.
3. A. Bulatov, Tractable conservative constraint satisfaction problems, in Proc. 18th IEEE Symposium on Logic in Computer Science (LICS'03), Ottawa, Canada (2003), pp. 321-330.
4. A. Bulatov, Malt'sev constraints are tractable, Research Report RR-02-05, Oxford University Computing Laboratory (April 2002).
5. A. Bulatov and V. Dalmau, Towards a dichotomy theorem for the counting constraint satisfaction problem, Foundations of Computer Science, Boston, MA (2003), 562-571;
6. IEEE Comput. Soc. (2003).
7. A. Bulatov and M. Grohe, The complexity of partition functions, in Proceedings of the 81st International Colloquium on Automata, Languages and Programming (ICALP'04), Lecture Notes in Computer Science, Vol. 3142 (2004), pp. 294-306.
8. A. Bulatov, P. Jeavons and A. Krokhin, Constraint satisfaction problems and finite algebras, in Proc. 27th Int. Colloquim on Automata, Languages and Programming (ICALP'00), Geneva, Switzerland, Lecture Notes in Comput. Sci. 1853 (2000) 272-282.
9. A. Bulatov, P. Jeavons and A. Krokhin, Classifying the complexity of constraints using finite algebras, SIAM J. Comput. 34(3) (2005) 720-742.
10. M. Clasen and M. Valeriote, Finite algebra, in Lectures on Algebraic Model Theory, eds. B. Hart and M. Valeriote, Fields Institute Monographs, Vol. 15 (Dec. 2001).
11. N. Creignou, S. Khanna and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monographs on Discrete Mathematics and Applications, Vol. 7 (SIAM, Philadelphia, 2001).
12. V. Dalmau, Ph. G. Kolaitis and M. Y. Vardi, Constraint satisfaction, bounded treewidth, and finite-variable logics. Principles and Practice of Constraint Programming (Ithaca, NY, 2002), Lecture Notes in Comput. Sci. 2470 (2002) 310-326.
13. T. Feder, F. Madelaine and I. A. Stewart, Dichotomies for classes of homomorphism problems involving unary functions, Theoret. Comput. Sci. 314 (2004) 1-43.
14. T. Feder and M. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory, in Proc. 25th Ann. ACM Symp. on Theory of Computing (1993), pp. 612-622.
15. 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. Comput. 28 (1998) 57-104.
16. M. Goldmann and A. Russell, The complexity of solving equations over finite groups, Inform. and Comput. 178(1) (2002) 253-262.
17. P. A. Grillet, Semigroups, An Introduction to the Structure Theory, Monographs and Textbooks in Pure and Applied Mathematics, 193 (Marcel Dekker, New York, 1995).
18. D. Hobby and R. McKenzie, The structure of finite algebras, Contemp. Math. 76 (1988).
19. P. G. Jeavons, On the algebraic structure of combinatorial problems, Theoret. Comput. Sci. 200 (1998) 185-204.
20. P. G. Jeavons, D. A. Cohen and M. Cooper, Constraints consistency and closure, Artificial Intelligence 101(1-2) (1998) 251-265.
21. K. Kearnes, Congruence join semidistributivity is equivalent to a congruence identity, Algebra Universalis 46(3) (2001) 373-387.
22. O. Klfma, P. Tesson and D. Thérien, Dichotomies in the complexity of solving systems of equations over finite semigroups, preprint (2004).
23. Ph. G. Kolaitis and M. Y. Vardi, Conjunctive-query containment and constraint satisfaction, J. Comput. System Sci. 61 (2000) 302-332.
24. A. Krokhin A. Bulatov and P. Jeavons, The complexity of constraint satisfaction: An algebraic approach, preprint.
25. O. Klima, B. Larose and P. Tesson, Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture, 12 pages, accepted, MFCS 2006.
26. B. Larose and L. Zádori, The complexity of the extendibility problem for finite posets, SIAM J. Discrete Math. 17(1) (2003) 114-121.
27. T. Luczak and J. Nešetřil, A probabilistic approach to the dichotomy problem, Technical Report 2003-640, Kam-Dimatia Series (2003).
28. A. K. Mackworth. Constraint satisfaction, in Encyclopedia of Artificial Intelligence, Vol. 1, ed. S. G. Shapiro (Wiley Interscience, 1992), pp. 285-293.
29. R. McKenzie, The number of non-isomorphic models in quasi-varieties of semigroups, Algebra Universalis 16 (1983) 195-203.
30. R. N. McKenzie, G. F. McNulty and W. F. Taylor, Algebras, Lattices and Varieties (Wadsworth and Brooks/Cole, Monterey, California, 1987).
31. C. Moore, P. Tesson and D. Thérien, Satisfiability of systems of equations over finite monoids, in Proc. MFCS 2001, LNCS 2136 (Springer), 537-547.
32. P. Jonsson and G. Nordh, The complexity of counting the number of solutions to systems of equations over finite algebraic structures, preprint (2003).
33. P. P. Pálfy, Unary polynomials in algebras I, Algebra Universalis 18 (1984) 262-273.
34. C. H. Papadimitriou, Computational Complexity (Addison-Wesley, 1994).
35. T. J. Schaefer, The complexity of the satisfiability problems, Proc. 10th ACM Symp. on Theory of Computing (STOC) No. 15 (1978), pp. 216-226.
36. B. Schwarz, The complexity of satisfiability problems over finite lattices, in Proc. 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), Montpellier, France, Lecture Notes in Comput. Sci. 2996 (2004) 31-43.
37. S. Seif, private communication.
38. S. Seif and Cs. Szabó, Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem, J. Complexity 19 (2003) 153-160.
39. S. Seif, Cs. Szabó and Z. Sokolovic, Complexity problems associated with matrix rings, matrix semigroups, and Rees matrix semigroups, preprint (1997).
40. S. Seif and Cs. Szabó, Computational complexity of checking identities in simple semigroups and matrix semigroups over finite fields, preprint (2003).
41. A. Szendrei, Clones in Universal Algebra, Sém. de Mathématiques Supérieures, 99, Séminaire Scientifique OTAN (les presses de l'Universitéde Montréal, 1986).
42. W. Taylor, Varieties obeying homotopy laws, Canad. J. Math. 29 (1977) 498-527.
43. W. Taylor, Laws obeyed by topological algebras - Extending results of Hopf and Adams, J. Pure Appl. Algebra 21 (1981) 75-98.
44. P. Tesson, Computational complexity questions related to finite semigroups and monoids, Ph.D. Thesis, School of Computer Science, McGill University, Montréal (2003).
45. R. J. Warne, Semigroups obeying the term condition, Algebra Universalis 31(1) (1994) 113-123.