501 citations · 1k across the 33 of their papers we have counts for
1 paper · 1 filter
Sergey I. Nikolenko
We address lower bounds on the time complexity of algorithms solving the propositional satisfiability problem. Namely, we consider two DPLL-type algorithms, enhanced with the unit…