2 search results - page 1 / 1 » Near Unanimity Constraints Have Bounded Pathwidth Duality |
LICS
2012
IEEE
11 years 7 months ago
2012
IEEE
—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...
EJC
2008
13 years 4 months ago
2008
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...