47 citations · 86 across the 11 of their papers we have counts for
1 paper · 2 filters
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger +2
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory.…