2 search results - page 1 / 1 » Near Unanimity Constraints Have Bounded Pathwidth Duality |
116
click to vote
LICS
2012
IEEE
13 years 14 days 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
14 years 10 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...