Tree dualities for constraint satisfaction

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

Volumn 6247 LNCS, Issue , 2010, Pages 32-33

  Krokhin, Andrei ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTION PROBLEMS; RESEARCH AREAS;

COMPUTER SCIENCE;

TECHNICAL PRESENTATIONS;

EID: 77956588256     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15205-4_4     Document Type: Conference Paper

References (6)

1. Barto, L., Kozik, M.: Constraint satisfaction problems of bounded width. In: FOCS 2009, pp. 595-603 (2009)
2. Bulatov, A., Krokhin, A., Larose, B.: Dualities for constraint satisfaction problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol.5250, pp. 93-124. Springer, Heidelberg (2008)
3. Carvalho, C., Dalmau, V., Krokhin, A.: Caterpillar duality for constraint satisfaction problems. In: LICS 2008, pp. 307-316 (2008)
4. Carvalho, C., Dalmau, V., Krokhin, A.: CSP duality and trees of bounded pathwidth. Theoretical Computer Science (2010) (to appear)
5. 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)
6. Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28, 57-104 (1998)