251 citations · 540 across the 15 of their papers we have counts for
1 paper · 2 filters
Niel de Beaudrap, Sevag Gharibian
The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deter…