Author:
Paturi Ramamohan,Pudlák Pavel,Saks Michael,Zane Francis
Reference12 articles.
1. Baumer S, Schuler R (2003) Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. In: SAT, Santa Margherita Ligure, pp 150–161
2. Calabro C, Impagliazzo R, Kabanets V, Paturi R (2003) The complexity of unique k-SAT: an isolation lemma for k-CNFs. In: Proceedings of the eighteenth IEEE conference on computational complexity, Aarhus
3. Dantsin E, Goerdt A, Hirsch EA, Kannan R, Kleinberg J, Papadimitriou C, Raghavan P, Schöning U (2002) A deterministic
(
2
−
2
k
+
1
)
n
$$(2 - \frac{2} {k+1})^{n}$$
algorithm for k-SAT based on local search. Theor Comp Sci 289(1):69–83
4. Davis M, Logemann G, Loveland D (1962) A machine program for theorem proving. Commun ACM 5:394–397
5. Hofmeister T, Schöning U, Schuler R, Watanabe O (2002) A probabilistic 3-SAT algorithm further improved. In: STACS, Antibes Juan-les-Pins. LNCS, vol 2285, Springer, Berlin, pp 192–202