PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Majority constraints have bounded pathwidth duality
Victor Dalmau and Andrei Krokhin
European Journal on Combinatorics 2006.


We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with a majority polymorphism. We show that such a problem is equivalent to deciding whether the given structure admits a homomorphism from an obstruction belonging to a certain class of structures of bounded pathwidth. This implies that the constraint satisfaction problem for every any fixed structure with a majority polymorphism is in NL

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:2902
Deposited By:Victor Dalmau
Deposited On:23 November 2006