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