8 citations · 10 across the 6 of their papers we have counts for
1 paper · 1 filter
Patrick Schnider, Simon Weber
Schaefer's dichotomy theorem [Schaefer, STOC'78] states that a boolean constraint satisfaction problem (CSP) is polynomial-time solvable if one of six given conditions holds for ev…