129 citations · 145 across the 6 of their papers we have counts for
1 paper · 1 filter
S. N. Coppersmith
Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists…