On the complexity of MMSNP

SIAM Journal on Discrete Mathematics

Volumn 26, Issue 1, 2012, Pages 404-414

  Bodirsky, Manuel ^a   Chen, Hubie ^b   Feder, Tomás ^c  

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c Stanford University   (United States)

Author keywords

Complexity dichotomy; Computational complexity; Constraint satisfaction problems; Existential second order logic

Indexed keywords

COMPLEXITY DICHOTOMIES; COMPUTATIONAL PROBLEM; CONSTRAINT LANGUAGE; CONSTRAINT SATISFACTION PROBLEMS; FINITE DOMAINS; FINITE STRUCTURES; FIXED SETS; LOOPLESS; PARTITION PROBLEM; SECOND-ORDER LOGIC;

MATHEMATICAL TECHNIQUES;

COMPUTATIONAL COMPLEXITY;

EID: 84861636149     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/090778493     Document Type: Article

References (13)

1. D. Achlioptas, The complexity of G-free colourability, Discrete Math., 165 (1997), pp. 21-30.
2. M. Bodirsky and V. Dalmau, Datalog and constraint satisfaction with infinite templates, preprint, 2008, available online at arXiv:0809.2386.
3. M. Bodirsky and J. Kára, The complexity of temporal constraint satisfaction problems, J. ACM, 57 (2009), 9.
4. M. Bodirsky and M. Pinsker, Schaefer's theorem for graphs, in Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011, pp. 655-664.
5. A. Bulatov, P. G. Jeavons, and A. Krokhin, Classifying the complexity of constraints using finite algebras, SIAM J. Comput., 34 (2005), pp. 720-742.
6. N. Creignou, S. Khanna, and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monogr. Discrete Math. Appl. 7, SIAM, Philadelphia, 2001.
7. 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 (1998), pp. 57-104.
8. P. Hell and J. Nešetřil, On the complexity of H-coloring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
9. G. Kun, Constraints, MMSNP, and Expander Relational Structures, preprint available at arXiv:0706.1701, 2007.
10. G. Kun and J. Nešetřil, NP by means of lifts and shadows, in Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, 2007, pp. 171-181.
11. F. Madelaine and I. A. Stewart, Constraint satisfaction, logic and forbidden patterns, SIAM J. Comput., 37 (2007), pp. 132-163.
12. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
13. T. J. Schaefer, The complexity of satisfiability problems, in Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978, pp. 216-226.