Sciweavers

86 search results - page 18 / 18
» Homomorphisms of 2-edge-colored graphs
Sort
View
ICALP
2007
Springer
14 years 29 days ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson