A probabilistic approach to the dichotomy problem

SIAM Journal on Computing

Volumn 36, Issue 3, 2006, Pages 835-843

  ŁUczak, Tomasz ^a   Nešetřil, Jaroslav ^b  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

CSP; Projectivity; Random relation

Indexed keywords

PROBABILISTIC LOGICS; RANDOM PROCESSES;

DICHOTOMY PROBLEM; RANDOM RELATION;

PROBLEM SOLVING;

EID: 34250857571     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703435492     Document Type: Article

References (14)

1. D. ACHLIOPTAS, L. M. KIROUSIS, E. KRANAKIS, D. KRIZANC, M. S. O. MOLLOY, AND Y. C, STAMATIOU, Random constraint satisfaction: A more accurate picture, Constraints, 6 (2001), pp. 329-344.
2. M. BODIRSKY AND J. NEŠETŘIL, Constraint satisfaction with countable homogeneous templates, in Computer Science Logic, Lecture Notes in Comput. Sci. 2803, Springer-Verlag, Berlin, 2003, pp. 44-57.
3. V. G. BODNARČUK, L. A. KALUZHNIN, V. N. KOTOV, AND B. A. ROMOV, Galois theory for Post algebras I-II, Kibernetika, 3 (1969), pp. 1-10 and 5 (1969), pp. 1-9 (in Russian); Cybernetics, (1969), pp. 243-252, 531-539 (English version).
4. A. BULATOV, A dichotomy theorem for constraints on a three element set, in Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2002, pp. 649-658.
5. A. BULATOV, A. KROKHIN, AND P. G. JEAVONS, The complexity of maximal constraint languages, in Proceedings of the ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 667-674.
6. 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.
7. P. HELL AND J. NEŠETŘIL, On the complexity of H-coloring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
8. P. HELL AND J. NEŠETŘIL, Graphs and Homomorphisms, Oxford University Press, Oxford, UK, 2004.
9. P. G. JEAVONS, On the algebraic structure of combinatorial problems, Theoret. Comput. Sci., 200 (1998), pp. 185-204.
10. B. LAROSE AND C. TARDIF, Strongly rigid graphs and projectivity, Mult.-Valued Log., 7 (2001), pp. 339-361.
11. B. LAROSE AND C. TARDIF, Projectivity and independent sets in powers of graphs, J. Graph Theory, 40 (2002), pp. 162-171.
12. T. ŁUCZAK AND J. NEŠETŘIL, A note on projective graphs, J. Graph Theory, 47 (2004), pp. 81-86.
13. I. G. ROSENBERG, Strongly rigid relations, Rocky Mountain J. Math., 3 (1973), pp. 631-639.
14. T. SCHAEFER, The complexity of satisfiability problems, in Proceedings of the ACM Symposium on Theory of Computing, ACM, New York, 1978, pp. 216-226.