48 citations · 103 across the 33 of their papers we have counts for
1 paper · 2 filters
Joshua Brakensiek, Venkatesan Guruswami
A classic result due to Schaefer (1978) classifies all constraint satisfaction problems (CSPs) over the Boolean domain as being either in P or NP-hard. This p…