New conditions for Taylor varieties and CSP

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2010, Pages 100-109

  Barto, Libor ^a   Kozik, Marcin ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b JAGIELLONIAN UNIVERSITY   (Poland)

Author keywords

Constraint satisfaction problem; Taylor conditions

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ABSORBING SET; ALGEBRAIC APPROACHES; CYCLIC OPERATION; LOCALLY FINITES; NEAR-UNANIMITY OPERATIONS; TAYLOR CONDITIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 78449292659     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2010.34     Document Type: Conference Paper

References (24)

1. Jørgen Bang-Jensen and Pavol Hell. The effect of two cycles on the complexity of colourings by directed graphs. Discrete Appl. Math., 26(1):1-23, 1990.
2. Libor Barto and Marcin Kozik. Full characterization of cylic terms (for finite algebras). in preparation.
3. Libor Barto and Marcin Kozik. Congruence distributivity implies bounded width. SIAM Journal on Computing, 39(4):1531-1542, 2009.
4. Libor Barto and Marcin Kozik. Constraint satisfaction problems of bounded width. In FOCS'09: Proceedings of the 50th Symposium on Foundations of Computer Science, pages 595-603, 2009.
5. Libor Barto, Marcin Kozik, Miklós Maróti, Ralph McKenzie, and Todd Niven. Congruence modularity implies cyclic terms for finite algebras. Algebra Universalis, 61(3):365-380, 2009.
6. Libor Barto, Marcin Kozik, and Todd Niven. Graphs, polymorphisms and the complexity of homomorphism problems. In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 789-796, New York, NY, USA, 2008. ACM.
7. Libor Barto, Marcin Kozik, and Todd Niven. The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM J. Comput., 38(5):1782-1802, 2008/09.
8. V. G. Bodnarčuk, L. A. Kalužnin, V. N. Kotov, and B. A. Romov. Galois theory for Post algebras. I, II. Kibernetika (Kiev), (3):1-10;
9. ibid. 1969, no. 5, 1-9, 1969.
10. Andrei Bulatov and Víctor Dalmau. A simple algorithm for Mal'tsev constraints. SIAM J. Comput., 36(1):16-27 (electronic), 2006.
11. Andrei Bulatov, Peter Jeavons, and Andrei Krokhin. Classifying the complexity of constraints using finite algebras. SIAM J. Comput., 34(3):720-742 (electronic), 2005.
12. Andrei A. Bulatov. A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM, 53(1):66-120 (electronic), 2006.
13. Andrei A. Bulatov, Andrei A. Krokhin, and Peter Jeavons. Constraint satisfaction problems and finite algebras. In Automata, languages and programming (Geneva, 2000), volume 1853 of Lecture Notes in Comput. Sci., pages 272-282. Springer, Berlin, 2000.
14. Víctor Dalmau. Generalized majority-minority operations are tractable. Log. Methods Comput. Sci., 2(4):4:1, 14, 2006.
15. Tomás Feder and Moshe Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput., 28(1):57-104 (electronic), 1999.
16. David Geiger. Closed systems of functions and predicates. Pacific J. Math., 27:95-100, 1968.
17. Pavol Hell and Jaroslav Nešetřil. On the complexity of H-coloring. J. Combin. Theory Ser. B, 48(1):92-110, 1990.
18. David Hobby and Ralph McKenzie. The structure of finite algebras, volume 76 of Contemporary Mathematics. American Mathematical Society, Providence, RI, 1988.
19. Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, and Ross Willard. Tractability and learnability arising from algebras with few subpowers. In LICS, pages 213-224. IEEE Computer Society, 2007.
20. Peter Jeavons, David Cohen, and Marc Gyssens. Closure properties of constraints. J. ACM, 44(4):527-548, 1997.
21. Miklós Maróti and Ralph McKenzie. Existence theorems for weakly symmetric operations. Algebra Universalis, 59(3-4):463-489, 2008.
22. Thomas J. Schaefer. The complexity of satisfiability problems. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), pages 216-226. ACM, New York, 1978.
23. Mark H. Siggers. A strong mal'cev condition for varieties omitting unary type. to appear, Algebra Universalis.
24. Walter Taylor. Varieties obeying homotopy laws. Canad. J. Math., 29(3):498-527, 1977.