On the CSP dichotomy conjecture

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

Volumn 6651 LNCS, Issue , 2011, Pages 331-344

  Bulatov, Andrei A ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

EID: 79959324103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20712-9_26     Document Type: Conference Paper

References (33)

1. Atserias, A., Bulatov, A., Dawar, A.: Affine systems of equations and counting infinitary logic. In: ICALP, pp. 558-570 (2007).
2. Barto, L.: The dichotomy for conservative constraint satisfaction problems revisited (2011).
3. Barto, L., Kozik,M.: Constraint satisfaction problems of bounded width. In: FOCS, pp. 595-603 (2009).
4. Bulatov, A.: Tractable conservative constraint satisfaction problems. In: Proceedings of the 18th Annual IEEE Simposium on Logic in Computer Science, Ottawa, Canada, pp. 321-330. IEEE Computer Society, Los Alamitos (2003).
5. Bulatov, A.: A graph of a relational structure and constraint satisfaction problems. LICS, pp. 448-457 (2004).
6. Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM 53(1), 66-120 (2006).
7. Bulatov, A.: Bounded relational width (2009).
8. Bulatov, A., Dalmau, V.: A simple algorithm for Mal'tsev constraints. SIAM J. Comput. 36(1), 16-27 (2006). (Pubitemid 46374016)
9. Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3), 720-742 (2005). (Pubitemid 40844240)
10. Bulatov, A., Krokhin, A., Larose, B.: Dualities for constraint satisfaction problems. In: Complexity of Constraints, pp. 93-124 (2008).
11. Bulatov, A., Valeriote,M.: Recent results on the algebraic approach to the CSP. In: Complexity of Constraints, pp. 68-92 (2008).
12. Dalmau, V., Pearson, J.: Set functions and width 1 problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 159-173. Springer, Heidelberg (1999).
13. Dalmau, V.: Generalized majority-minority operations are tractable. Logical Methods in Computer Science 11(1) (2005) (electronic).
14. Fagin, R.: Generalized first order spectra, and polynomial time recognizable sets. In: Complexity of Computations (1974).
15. Feder, T., Vardi, M.Y.: Monotone monadic SNP and constraint satisfaction. In: Proceedings of 25th ACM Symposium on the Theory of Computing (STOC), pp. 612-622 (1993). (Pubitemid 23668734)
16. Feder, T., Vardi,M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal of Computing 28, 57-104 (1998). (Pubitemid 128491791)
17. Freese, R., Valeriote, M.: On the complexity of some maltsev conditions. IJAC 19(1), 41-77 (2009).
18. Freuder, E.C.: Synthesizing constraint expressions. Communications of the ACM 21, 958-966 (1978).
19. Hell, P., Nesetril, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Ser.B 48, 92-110 (1990).
20. Hobby, D., McKenzie, R.N.: The Structure of Finite Algebras. Contemporary Mathematics, vol. 76. American Mathematical Society, Providence (1988).
21. Idziak, P., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and learnability arising from algebras with few subpowers. SIAM J. Comput. 39(7), 3023-3037 (2010).
22. Jeavons, P., Cohen, D., Cooper, M.: Constraints, consistency and closure. Artificial Intelligence 101(1-2), 251-265 (1998). (Pubitemid 128387395)
23. Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44, 527-548 (1997). (Pubitemid 127617702)
24. Kolaitis, P., Vardi, M.: A game-theoretic approach to constraint satisfaction. In: Proceedings of the 17th National (US) Conference on Artificial Intelligence, AAAI 2000, pp. 175-181 (2000).
25. Kolaitis, P., Vardi, M.: The decision problem for the probabilities of higher-order properties. In: STOC, pp. 425-435 (1987). (Pubitemid 18643430)
26. Kun, G.: Constraints, MMSNP and expander relational structures. Mathematics, abs/0706.1701 (2007).
27. Kun, G., Nesetril, J.: NP by means of lifts and shadows. In: Kucera, L., Kucera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 171-181. Springer, Heidelberg (2007).
28. Ladner, R.: On the structure of polynomial time reducibility. Journal of the ACM 22, 155-171 (1975).
29. Larose, B., Tesson, P.: Universal algebra and hardness results for constraint satisfaction problems. In: Arge, L., Cachin, C., Jurdzínski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 267-278. Springer, Heidelberg (2007).
30. Larose, B., Valeriote, M., Źadori, L.: Omitting types, bounded width and the ability to count. IJAC 19(5), 647-668 (2009).
31. Madelaine, F., Stewart, I.: Constraint satisfaction, logic and forbidden patterns. SIAM J. Comput. 37(1), 132-163 (2007). (Pubitemid 351321990)
32. Reingold, O.: Undirected st-connectivity in log-space. In: STOC, pp. 376-385 (2005). (Pubitemid 43098608)
33. Schaefer, T.: The complexity of satisfiability problems. In: Proceedings of the 10th ACM Symposium on Theory of Computing (STOC 1978), pp. 216-226 (1978)