Sciweavers

COCO
2004
Springer
133views Algorithms» more  COCO 2004»
13 years 10 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx