Sciweavers

LICS
2012
IEEE

Near Unanimity Constraints Have Bounded Pathwidth Duality

12 years 17 days ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded pathwidth duality (equivalently, the complement of the problem is definable in linear Datalog). As a consequence, the problem is in the complexity class NL. This generalizes the analogous result of Dalmau and Krokhin for majority polymorphisms and lends further support to a conjecture suggested by Larose and Tesson.
Libor Barto, Marcin Kozik, Ross Willard
Added 29 Sep 2012
Updated 29 Sep 2012
Type Journal
Year 2012
Where LICS
Authors Libor Barto, Marcin Kozik, Ross Willard
Comments (0)