2 citations · 4 across the 7 of their papers we have counts for
1 paper · 2 filters
Pavel Pudlák, Dominik Scheder, Navid Talebanfard
We construct uniquely satisfiable k-CNF formulas that are hard for the algorithm PPSZ. Firstly, we construct graph-instances on which "weak PPSZ" has savings of at most $(2 + ε)…