Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654377 | European Journal of Combinatorics | 2008 | 17 Pages |
Abstract
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 any fixed structure with a majority polymorphism is in NL.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Víctor Dalmau, Andrei Krokhin,