Majority constraints have bounded pathwidth duality

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.

• Type: Journal
• Year: 2008
• Where: EJC
• Authors: Víctor Dalmau, Andrei A. Krokhin
• Keywords: Certain Constraint Satisfaction, Constraint Satisfaction Problem, EJC 2007, EJC 2008, Information Technology, Majority Polymorphism