97 citations · 346 across the 14 of their papers we have counts for
1 paper · 1 filter
Jingyuan Zhu, Aseem Salhotra, Christoph Robert Meinecke +8
The 3-Satisfiability Problem (3-SAT) is a demanding combinatorial problem, of central importance among the non-deterministic polynomial (NP) complete problems, with applications in…