There are no pure relational width 2 constraint satisfaction problems

Authors:
Víctor Dalmau
Affiliations:
Departament de tecnologies de la informació i les comunicacions, Universitat Pompeu Fabra, Estació de França, Passeig de la circumval.lació 8, 08003 Barcelona, Spain
Venue:
Information Processing Letters
Year:
2009

Citing 8
Cited 0

Chromatically optimal rigid graphs

Journal of Combinatorial Theory Series B
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
Tractable conservative Constraint Satisfaction Problems

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A Graph of a Relational Structure and Constraint Satisfaction Problems

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Classifying the Complexity of Constraints Using Finite Algebras

SIAM Journal on Computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set

Journal of the ACM (JACM)
Tractability and learnability arising from algebras with few subpowers

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this note, we show that every constraint satisfaction problem that has relational width 2 has also relational width 1. This is achieved by means of an obstruction-like characterization of relational width which we believe to be of independent interest.