An Improved Deterministic SAT Algorithm for Small De Morgan Formulas

Ruiwen Chen, Valentine Kabanets, Nitin Saurabh

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We give a deterministic #SAT algorithm for de Morgan formulas of size up to n 2.63, which runs in time TeX . This improves upon the deterministic #SAT algorithm of [3], which has similar running time but works only for formulas of size less than n 2.5.

Our new algorithm is based on the shrinkage of de Morgan formulas under random restrictions, shown by Paterson and Zwick [12]. We prove a concentrated and constructive version of their shrinkage result. Namely, we give a deterministic polynomial-time algorithm that selects variables in a given de Morgan formula so that, with high probability over the random assignments to the chosen variables, the original formula shrinks in size, when simplified using a deterministic polynomial-time formula-simplification algorithm.
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2014
Subtitle of host publication39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II
PublisherSpringer Berlin Heidelberg
Number of pages12
ISBN (Electronic)978-3-662-44465-8
ISBN (Print)978-3-662-44464-1
Publication statusPublished - 2014


Dive into the research topics of 'An Improved Deterministic SAT Algorithm for Small De Morgan Formulas'. Together they form a unique fingerprint.

Cite this