A new line of attack on the dichotomy conjecture

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 725-734

  Kun, Gábor ^a   Szegedy, Mario ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Computational Complexity; Constraint Satisfaction Problems; Dichotomy; Fourier Analysis; NP; Term Operations

Indexed keywords

ALGEBRAIC CONDITIONS; ASYMPTOTIC PROPERTIES; CONSTRAINT SATISFACTION PROBLEMS; DICHOTOMY; NP; NP-HARD; PEBBLE GAME; RESILIENT FUNCTION; TERM OPERATIONS; UNDIRECTED GRAPH;

ALGEBRA; COMPUTER OPERATING PROCEDURES; COMPUTER SCIENCE; EQUIVALENCE CLASSES; FOURIER ANALYSIS; STEELMAKING; THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 70350700879     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536512     Document Type: Conference Paper

References (30)

1. L. Barto, M. Kozik, T. Niven, CSP dichotomy holds for digraphs with no sink and source, SIAM J. on Computing, accepted, 2008.
2. L. Barto, M. Kozik, Constraint Satisfaction Problems of bounded width, manuscript.
3. J. Berman, P. Idziak, P. Marković, R. McKenzie, M. Valeriote, R. Willard, Tractability and learnability arising from algebras with few subpowers, Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), (2007), 213-224.
4. A. Bulatov, A dichotomy theorem for constraints on a three-element set, Journal of the ACM, 53(1), 2006, 66-120.
5. A. Bulatov, Tractable conservative constraint satisfaction problems, Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), (2003), 321-330.
6. A. Bulatov, V.Dalmau Mal'tsev constraints are tractable, SIAM J. on Computing, 36(1), 2006, 16-27.
7. A. Bulatov, V. Dalmau, Towards a dichotomy theorem for the counting constraint satisfaction problem, Information and Computation, 205(5), 2007, pp. 651-678.
8. A. Bulatov, P. Jeavons, A. A. Krokhin, Constraint satisfaction problems and finite algebras, Automata, languages and programming (Geneva, 2001), Lecture notes in Comput. Sci., 1853, Springer, Berlin, (2002), 272-282.
9. P. G. Jeavons, D. A. Cohen and M. Cooper, Constraints consistency and closure, Artficial Intelligence, 101 (1998) 251-265.
10. P. G. Jeavons, D. A. Cohen and M. Gyssens, Closure properties of constraints, J. of the ACM 44, 1997, 527-548.
11. V. Dalmau, Generalized majority-minority operations are tractable, LICS05.
12. V. Dalmau, P. G. Kolaitis, M. Vardi, Conjunctive query-containment and constraint satisfaction, Journal of Computer and System Sciences, 61(2):302-332, 2000.
13. V. Dalmau and J. Pearson, Set Functions and Width 1 Problems, Principles and Practice of Constraint Programming, CP'99.
14. Irit Dinur, The PCP Theorem by gap amplification JACM, Proc. of 38th STOC, pp. 241-250, 2006.
15. Irit Dinur, Ehud Friedgut, Oded Regev, Independent Sets in Graph Powers are Almost Contained in Juntas, Geometric and Functional Analysis, accepted.
16. T. Feder, M. Y. Vardi, The computational stucture of monotone monadic (SNP) and constraint satisfaction: A study through datalog and group theory, SIAM Journal of Computing 28, (1998), 57-104.
17. J. Foniok, J. Nešetřil, C. Tardif, Generalized dualities and maximal nite antichains in the homomorphism order of relational structures, KAM-DIMATIA Series 2006-766 (to appear in European J. Comb.).
18. P. Hell, J. Nešetřil, On the complexity of H-coloring, J. Combin. Theory Ser. B, 48, (1990), 92-110.
19. P. Hell, J. Nešetřil, Colouring, Constraint Satisfaction and Complexity, manuscript, 2008. http://iti.mff.cuni.cz/series/files/ iti413.eps
20. P. Hell, J. Nešetřil, X. Zhu, Duality and polynomial testing of tree homomorphisms, Transactions of the American Mathematical Society, 348(4):1281-1297, 1996.
21. G. Kun, Constraints, MMSNP and expander relational structures, Combinatorica, submitted.
22. G. Kun, J. Nešetřil: Forbidden lifts (NP and CSP for combinatorists), European J. Comb. 29, (2008), 930U945.
23. R. E. Ladner: On the structure of Polynomial Time Reducibility, Journal of the ACM, 22,1 (1975), 155-171.
24. B. Larose, L. Zádori, M. Valeriote, Omitting types, bounded width and the ability to count, manuscript, 2008.
25. R. McKenzie, M. Maróti: Existence theorems for weakly symmetric operations, Algebra Universalis, to appear.
26. J. Nešeťril, M. Siggers, L. Zádori: A Combinatorial constraint satisfaction problem dichotomy class cation conjecture, manuscript, 2007.
27. J. Něseťril and X. Zhu, On bounded treewidth duality of graphs, J. of Graph Theory 23, 151-162, 1996.
28. Y. Rabinovich, A. Sinclair, A. Wigderson: Quadratic Dynamical Systems (Preliminary Version) FOCS 1992: 304-313.
29. T. J. Schaefer, The complexity of satis ability problems, Proc. of the 10th STOC, pp. 216-226, 1978.
30. Cs. Szabó, L. Zádori, Idempotent totally symmetric operatins on finite posets, Order 18, 39-47, 2001.