Robust satisfiability of constraint satisfaction problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 931-940

  Barto, Libor ^a,b   Kozik, Marcin ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b CHARLES UNIVERSITY   (Czech Republic)

^c JAGIELLONIAN UNIVERSITY   (Poland)

Author keywords

approximation; bounded width; constraint satisfaction problem; robust satisfiability; universal algebra

Indexed keywords

APPROXIMATION; BOUNDED WIDTH; CONSTRAINT SATISFACTION PROBLEMS; SATISFIABILITY; UNIVERSAL ALGEBRA;

ALGORITHMS; FORMAL LOGIC;

CONSTRAINT THEORY;

EID: 84862624172     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214061     Document Type: Conference Paper

References (24)

1. L. Barto and M. Kozik. Constraint satisfaction problems of bounded width. In FOCS'09: Proceedings of the 50th Symposium on Foundations of Computer Science, pages 595-603, 2009.
2. L. Barto and M. Kozik. Constraint satisfaction problems solvable by local consistency methods. 2012. submitted.
3. A. Bulatov. Bounded relational width. 2009. manuscript.
4. A. Bulatov, P. Jeavons, and A. Krokhin. Classifying the complexity of constraints using finite algebras. SIAM J. Comput., 34:720-742, March 2005. (Pubitemid 40844240)
5. A. A. Bulatov, A. Krokhin, and B. Larose. Complexity of constraints. chapter Dualities for Constraint Satisfaction Problems, pages 93-124. Springer-Verlag, Berlin, Heidelberg, 2008.
6. M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for unique games. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, STOC '06, pages 205-214, New York, NY, USA, 2006. ACM.
7. M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for maximum constraint satisfaction problems. ACM Trans. Algorithms, 5:32:1-32:14, July 2009.
8. V. Dalmau and A. Krokhin. Robust satisfiability for CSPs: algorithmic and hardness results. 2011. in preparation.
9. 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:57-104, February 1999. (Pubitemid 128491791)
10. R. Freese, M. Kozik, A. Krokhin, M. Maróti, R. McKenzie, and R. Willard. On Maltsev conditions associated with omitting certain types of local structures. 2011. in preparation.
11. M. X. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
12. V. Guruswami and Y. Zhou. Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set. In D. Randall, editor, SODA, pages 1574-1589. SIAM, 2011.
13. J. Håstad. Some optimal inapproximability results. J. ACM, 48:798-859, July 2001.
14. P. Jonsson, A. Krokhin, and F. Kuivinen. Hard constraint satisfaction problems have hard gaps at location 1. Theor. Comput. Sci., 410:3856-3874, September 2009.
15. Z. S. Karnin, Y. Rabani, and A. Shpilka. Explicit dimension reduction and its applications. Electronic Colloquium on Computational Complexity (ECCC), 16:121, 2009.
16. S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson. The approximability of constraint satisfaction problems. SIAM J. Comput., 30(6):1863-1920, 2000. (Pubitemid 34125441)
17. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 767-775. ACM Press, 2002.
18. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput., 37:319-357, April 2007. (Pubitemid 351321999)
19. G. Kun, R. O'Donnell, S. Tamaki, Y. Yoshida, and Y. Zhou. Linear programming, width-1 CSPs and robust satisfaction. 2011. manuscript.
20. B. Larose and P. Tesson. Universal algebra and hardness results for constraint satisfaction problems. Theor. Comput. Sci., 410:1629-1647, April 2009.
21. B. Larose and L. Zádori. Bounded width problems and algebras. Algebra Universalis, 56(3-4):439-466, 2007.
22. P. Raghavendra. Optimal algorithms and inapproximability results for every CSP? In STOC'08, pages 245-254, 2008.
23. T. 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.
24. U. Zwick. Finding almost-satisfying assignments. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, STOC '98, pages 551-560, New York, NY, USA, 1998. ACM.