Sciweavers

6 search results - page 2 / 2
» Constraint Satisfaction with Countable Homogeneous Templates
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 2 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker