1. Calabro C, Impagliazzo R, Kabanets V, Paturi R (2008) The complexity of unique k-SAT: an isolation lemma for k-CNFs. J Comput Syst Sci 74(3):386–393
2. Hertli T (2011) 3-SAT faster and simpler—unique-SAT bounds for PPSZ hold in general. In: 2011 IEEE 52nd annual symposium on foundations of computer science—FOCS 2011, Palm Springs. IEEE Computer Society, Los Alamitos, pp 277–284
3. Iwama K, Tamaki S (2004) Improved upper bounds for 3-SAT. In: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, New Orleans. ACM, New York, pp 328–329 (electronic)
4. Kullmann O (1997) Worst-case analysis, 3-SAT decision and lower bounds: approaches for improved SAT algorithms. In: Satisfiability problem: theory and applications, Piscataway, 1996. DIMACS series in discrete mathematics and theoretical computer science, vol 35. American Mathematical Society, Providence, pp 261–313
5. Makino K, Tamaki S, Yamamoto M (2011) Derandomizing HSSW algorithm for 3-SAT. In: Computing and combinatorics, Dallas. Lecture notes in computer science, vol 6842. Springer, Heidelberg, pp 1–12