25 citations · 75 across the 16 of their papers we have counts for
1 paper · 1 filter
Jiaxuan You, Haoze Wu, Clark Barrett +2
The Boolean Satisfiability (SAT) problem is the canonical NP-complete problem and is fundamental to computer science, with a wide array of applications in planning, verification, a…