Breaking the PPSZ Barrier for Unique 3-SAT
The PPSZ algorithm by Paturi, Pudlák, Saks, and Zane (FOCS 1998) is the fastest known algorithm for (Promise) Unique k-SAT. We give an improved algorithm with exponentially faster bounds for Unique 3-SAT.
For uniquely satisfiable 3-CNF formulas, we do the following case distinction: We call a clause critical if exactly one literal is satisfied by the unique satisfying assignment. If a formula has many critical clauses, we observe that PPSZ by itself is already faster. If there are only few clauses in total, we use an algorithm by Wahlström (ESA 2005) that is faster than PPSZ in this case. Otherwise we have a formula with few critical and many non-critical clauses. Non-critical clauses have at least two literals satisfied; we show how to exploit this to improve PPSZ.
KeywordsSuccess Probability Randomized Algorithm Satisfying Assignment Promise Problem Satisfying Truth Assignment
Unable to display preview. Download preview PDF.
- 2.Hertli, T.: 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, pp. 277–284. IEEE Computer Soc., Los Alamitos (2011)Google Scholar
- 3.Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity. J. Comput. System Sci. 63(4), 512–530 (2001); Special issue on FOCS 1998 (Palo Alto, CA)Google Scholar
- 4.Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 328–329 (electronic). ACM Press, New York (2004)Google Scholar
- 6.Paturi, R., Pudlák, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-SAT. J. ACM 52(3), 337–364 (electronic) (2005)Google Scholar
- 7.Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 410–414. IEEE Computer Society, Los Alamitos (1999)Google Scholar
- 9.Welzl, E.: Boolean Satisfiability – Combinatorics and Algorithms (Lecture Notes) (2005), www.inf.ethz.ch/~emo/SmallPieces/SAT.ps