An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas
Abstract
We give a deterministic #SAT algorithm for de Morgan formulas of size up to $$n^{2.63}$$n2.63, which runs in time $$2^{n-n^{{\varOmega }(1)}}$$2n-nΩ(1). This improves upon the deterministic #SAT algorithm of Chen et al. (Proceedings of the twenty-ninth annual IEEE conference on computational complexity, 2014), which has similar running time but works only for formulas of size less than $$n^{2.5}$$n2.5. Our new algorithm is based on the shrinkage of de Morgan formulas under random restrictions, shown by Paterson and Zwick (Random Struct Algorithms 4(2):135---150, 1993). 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 given deterministic polynomial-time formula-simplification algorithm.
References
[1]
Andreev, A.: On a method of obtaining more than quadratic effective lower bounds for the complexity of $$\pi $$¿-schemes. Vestnik Moskovskogo Universiteta. Matematika 42(1), 70---73 (1987). English translation in Moscow University Mathematics Bulletin
[2]
Beame, P., Impagliazzo, R., Srinivasan, S.: Approximating $${{\sf AC}}^0$$AC0 by small height decision trees and a deterministic algorithm for #$${\sf AC}^0$$AC0SAT. In: Proceedings of the Twenty-Seventh Annual IEEE Conference on Computational Complexity, pp. 117---125 (2012)
[3]
Chen, R., Kabanets, V., Kolokolova, A., Shaltiel, R., Zuckerman, D.: Mining circuit lower bound proofs for meta-algorithms. In: Proceedings of the Twenty-Ninth Annual IEEE Conference on Computational Complexity (2014)
[4]
Håstad, J.: Almost optimal lower bounds for small depth circuits. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 6---20 (1986)
[5]
Håstad, J.: The shrinkage exponent of de Morgan formulae is 2. SIAM J. Comput. 27, 48---64 (1998)
[6]
Impagliazzo, R., Matthews, W., Paturi, R.: A satisfiability algorithm for $$\text{ AC }^0$$AC0. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 961---972 (2012)
[7]
Impagliazzo, R., Meka, R., Zuckerman, D.: Pseudorandomness from shrinkage. In: Proceedings of the Fifty-Third Annual IEEE Symposium on Foundations of Computer Science, pp. 111---119 (2012)
[8]
Impagliazzo, R., Nisan, N.: The effect of random restrictions on formula size. Random Struct. Algorithms 4(2), 121---134 (1993)
[9]
Komargodski, I., Raz, R.: Average-case lower bounds for formula size. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 171---180 (2013)
[10]
Komargodski, I., Raz, R., Tal, A.: Improved average-case lower bounds for DeMorgan formula size. In: Proceedings of the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science, pp. 588---597 (2013)
[11]
Paterson, M., Zwick, U.: Shrinkage of de Morgan formulae under restriction. Random Struct. Algorithms 4(2), 135---150 (1993)
[12]
Paturi, R., Pudlák, P., Zane, F.: Satisfiability coding lemma. Chic. J. Theor. Comput. Sci. (1999)
[13]
Santhanam, R.: Fighting perebor: new and improved algorithms for formula and QBF satisfiability. In: Proceedings of the Fifty-First Annual IEEE Symposium on Foundations of Computer Science, pp. 183---192 (2010)
[14]
Seto, K., Tamaki, S.: A satisfiability algorithm and average-case hardness for formulas over the full binary basis. In: Proceedings of the Twenty-Seventh Annual IEEE Conference on Computational Complexity, pp. 107---116 (2012)
[15]
Subbotovskaya, B.: Realizations of linear function by formulas using $$\vee $$¿,&,$${}^{-}$$-. Doklady Akademii Nauk SSSR 136(3), 553---555 (1961). English translation in Soviet Mathematics Doklady
[16]
Trevisan, L., Xue, T.: A derandomized switching lemma and an improved derandomization of AC$$^0$$0. In: Proceedings of the Twenty-Eighth Annual IEEE Conference on Computational Complexity, pp. 242---247 (2013)
[17]
Williams, R.: Improving exhaustive search implies superpolynomial lower bounds. In: Proceedings of the Forty-Second Annual ACM Symposium on Theory of Computing, pp. 231---240 (2010)
[18]
Williams, R.: Non-uniform ACC circuit lower bounds. In: Proceedings of the Twenty-Sixth Annual IEEE Conference on Computational Complexity, pp. 115---125 (2011)
- An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas
Recommendations
Shrinkage of De Morgan Formulae by Spectral Techniques
FOCS '14: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer ScienceWe give a new and improved proof that the shrinkage exponent of De Morgan formulae is 2. Namely, we show that for any Boolean function f : {0,1}n → {0,1}, setting each variable out of x1,…,xn with probability 1 -- p to a randomly chosen constant, ...
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates
The class FORMULA[s]∘G consists of Boolean functions computable by size-s De Morgan formulas whose leaves are any Boolean functions from a class G. We give lower bounds and (SAT, Learning, and pseudorandom generators (PRGs)) algorithms for FORMULA[n1.99]∘...
Improved deterministic distributed matching via rounding
AbstractWe present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a ...
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 2016 Springer Science+Business Media New York.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 September 2016
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Jan 2025