Tractable clones of polynomials over semigroups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 196-210

  Dalmau, Víctor ^a   Gavaldà, Ricard ^b   Tesson, Pascal ^c   Thérien, Denis ^d  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c UNIVERSITÉ LAVAL   (Canada)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLONES; CONSTRAINT SATISFACTION; TRACTABILITY;

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; THEOREM PROVING;

POLYNOMIALS;

EID: 33646244018     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_17     Document Type: Conference Paper

References (16)

1. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proc. of 43rd Foundations of Comp. Sci. (FOCS'02), pages 649-658, 2002.
2. A. Bulatov. Malt'sev constrains are tractable. Electronic Colloquium on Computational Complexity (ECCC), 2002.
3. A. Bulatov and V. Dalmau. A simple algorithm for Malt'sev constraints. Submitted, 2005.
4. A. Bulatov and P. Jeavons. An algebraic approach to multi-sorted constraints: In Principles and Practice of Constraint Programming (CP'03), pages 183-193, 2003.
5. A. Bulatov, P. Jeavons, and M. Volkov. Finite semigroups imposing tractable constraints. In G. Gomez, P. Suva, and J-E.Pin, editors, Semigroups, Algorithms, Automata and Languages, pages 313-329. WSP, 2002.
6. A. Bulatov, A. Krokhin, and P. Jeavons. Constraint satisfaction problems and finite algebras. In Proc. 27th Int. Col. on Automata, Languages and Programming (ICALP'00), pages 272-282, 2000.
7. V. Dalmau. A new tractable class of constraint satisfaction problems. In 6th Int. Symp on Artificial Intelligence and Mathematics, 2000.
8. V. Dalmau and J. Pearson. Closure functions and width 1 problems. In Principles and Practice of Constraint Programming-CP'99, pages 159-173, 1999.
9. T. Feder. Constraint satisfaction on finite groups with near subgroups. Electronic Colloquium on Computational Complexity (ECCC), 2005.
10. 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. on Computing, 28(1):57-104, 1998.
11. P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200(1-2):185-204, 1998.
12. P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. J. ACM, 44 (4): 527-548, 1997.
13. O. Klíma, P. Tesson, and D. Thérien. Dichotomies in the complexity of solving systems of equations over finite semigroups. Theory of Computing Systems, 2005.
14. B. Larose and L. Zádori. Taylor terms, constraint satisfaction and the complexity of polynomial equations over finite algebras. Submitted for publication, 2004.
15. J.-É. Pin. PG = BG, a success story. In J. Fountain, editor, NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pages 33-47. Kluwer Academic Publishers, 1995.
16. th ACM STOC, pages 216-226, 1978.