27 citations · 45 across the 4 of their papers we have counts for
1 paper · 1 filter
Zewen Zhang, Roger Paredes, Bhuvanesh Sundar +5
The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it ha…