The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

NP is as easy as detecting unique solutions

Leslie G. Valiant, Vijay V. Vazirani · Theoretical Computer Science · 1986 · 659 citations

Computing, Computer Science, Artificial Intelligence +4

Solving satisfiability in less than 2n steps

Burkhard Monien, Ewald Speckenmeyer · Discrete Applied Mathematics · 1985 · 253 citations

Computing, Computer Science, Mathematics +8

A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search

Evgeny Dantsin, Andreas Goerdt, Edward Hirsch et al. · Theoretical Computer Science · 2002 · 229 citations

Computing, Computer Science, Algorithms +7

An improved exponential-time algorithm for <i>k</i> -SAT

Ramamohan Paturi, Pavel Pudlák, Michael Saks et al. · Journal of the ACM · 2005 · 216 citations

Computing, Computer Science, Algorithms +16

An improved exponential-time algorithm for k-SAT

Ramamohan Paturi, P. Pudlik, Michael Saks et al. · 2002 · 159 citations

Computing, Computer Science, Mathematics +13