Tree dualities for constraint satisfaction

Authors:
Andrei Krokhin
Affiliations:
School of Engineering and Computing Sciences, Durham University, Durham, UK
Venue:
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Year:
2010

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Closure Functions and Width 1 Problems

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Caterpillar Duality for Constraint Satisfaction Problems

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Dualities for Constraint Satisfaction Problems

Complexity of Constraints
Constraint Satisfaction Problems of Bounded Width

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
CSP duality and trees of bounded pathwidth

Theoretical Computer Science

Hi-index	0.00