Negation-Limited Formulas

We give an efficient structural decomposition theorem for formulas that depends on their negation complexity and demonstrate its power with the following applications. We prove that every formula that contains t negation gates can be shrunk using a random restriction to a formula of size O(t) with the shrinkage exponent of monotone formulas. As a result, the shrinkage exponent of formulas that contain a constant number of negation gates is equal to the shrinkage exponent of monotone formulas. We give an efficient transformation of formulas with t negation gates to circuits with log(t) negation gates. This transformation provides a generic way to cast results for negation-limited circuits to the setting of negation-limited formulas. For example, using a result of Rossman (CCC'15), we obtain an average-case lower bound for formulas of polynomial-size on n variables with n^{1/2-epsilon} negations. In addition, we prove a lower bound on the number of negations required to compute one-way permutations by polynomial-size formulas.

[1]  Shao Chin Sung,et al.  Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem , 2003, ISAAC.

[2]  Tal Malkin,et al.  The Power of Negations in Cryptography , 2015, TCC.

[3]  Uri Zwick,et al.  Shrinkage of de Morgan formulae under restriction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  Troy Lee,et al.  A note on the sign degree of formulas , 2009, ArXiv.

[5]  Oded Goldreich,et al.  Monotone Circuits: One-Way Functions versus Pseudorandom Generators , 2012, Theory Comput..

[6]  Noam Nisan,et al.  Pseudorandom bits for constant depth circuits , 1991, Comb..

[7]  R. Raz,et al.  On the Noise Stability of Small De Morgan Formulas , 2013 .

[8]  Uri Zwick,et al.  How Do Read-Once Formulae Shrink? , 1994, Comb. Probab. Comput..

[9]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[10]  Alexander Russell,et al.  Spectral Bounds on General Hard Core Predicates , 2000, STACS.

[11]  Ran Raz,et al.  Higher lower bounds on monotone size , 2000, STOC '00.

[12]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[13]  Akira Maruoka,et al.  A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates , 2005, SIAM J. Comput..

[14]  Noga Alon,et al.  The monotone circuit complexity of boolean functions , 1987, Comb..

[15]  Yaoyun Shi.  Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables , 2000, Inf. Process. Lett..

[16]  Russell Impagliazzo,et al.  Pseudorandomness from Shrinkage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[17]  Nader H. Bshouty,et al.  On the Fourier spectrum of monotone functions , 1996, JACM.

[18]  Yuval Ishai,et al.  Cryptography in NC0 , 2004, SIAM J. Comput..

[19]  E. Gilbert.  Review: A. A. Markov, On the Inversion Complexity of a System of Functions , 1965 .

[20]  Toniann Pitassi,et al.  Communication lower bounds via critical block sensitivity , 2013, STOC.

[21]  Johan Hå stad.  The Shrinkage Exponent of de Morgan Formulas is 2 , 1998 .

[22]  Siyao Guo,et al.  Sparse extractor families for all the entropy , 2012, ITCS '13.

[23]  Noam Nisan,et al.  The Effect of Random Restrictions on Formula Size , 1993, Random Struct. Algorithms.

[24]  V. M. Khrapchenko.  Method of determining lower bounds for the complexity of P-schemes , 1971 .

[25]  Moni Naor,et al.  Number-theoretic constructions of efficient pseudo-random functions , 2004, JACM.

[26]  Tetsuro Nishino,et al.  Negation-Limited Circuit Complexity of Symmetric Functions , 1996, Inf. Process. Lett..

[27]  Miklos Santha,et al.  Polynomial Size Constant Depth Circuits with a Limited Number of Negations , 1991, STACS.

[28]  Tetsuro Nishino,et al.  On the Complexity of Negation-Limited Boolean Networks , 1998, SIAM J. Comput..

[29]  ApplebaumBenny,et al.  Cryptography in $NC^0$ , 2006 .

[30]  Christer Berg,et al.  Symmetric approximation arguments for monotone lower bounds without sunflowers , 1999, computational complexity.

[31]  Valentine Kabanets,et al.  An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas , 2014, Algorithmica.

[32]  A. A. Markov.  On the Inversion Complexity of a System of Functions , 1958, JACM.

[33]  Russell Impagliazzo,et al.  Fourier Concentration from Shrinkage , 2014, Computational Complexity Conference.

[34]  Johan Håstad.  One-Way Permutations in NC0 , 1987, Inf. Process. Lett..

[35]  Hiroki Morizumi.  Limiting Negations in Formulas , 2009, ICALP.

[36]  Kazuo Iwama,et al.  Negation-Limited Complexity of Parity and Inverters , 2006, ISAAC.

[37]  Leslie G. Valiant,et al.  Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.

[38]  Akira Maruoka,et al.  A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates , 1998, MFCS.

[39]  Ran Raz,et al.  Probabilistic Communication Complexity of Boolean Relations (Extended Abstract) , 1989, IEEE Annual Symposium on Foundations of Computer Science.

[40]  Avishay Tal,et al.  Shrinkage of De Morgan Formulae by Spectral Techniques , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[41]  Ran Raz,et al.  Improved Average-Case Lower Bounds for DeMorgan Formula Size , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[42]  Noam Nisan,et al.  Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[43]  Éva Tardos,et al.  The gap between monotone and non-monotone circuit complexity is exponential , 1988, Comb..

[44]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[45]  Uri Zwick,et al.  Shrinkage of de Morgan Formulae under Restriction , 1993, Random Struct. Algorithms.

[46]  David Zuckerman,et al.  Mining Circuit Lower Bound Proofs for Meta-Algorithms , 2014, computational complexity.

[47]  Rocco A. Servedio,et al.  Learning circuits with few negations , 2014, Electron. Colloquium Comput. Complex..

[48]  Stasys Jukna,et al.  Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.

[49]  Michel Talagrand,et al.  How much are increasing sets positively correlated? , 1996, Comb..

[50]  Michael J. Fischer.  Hauptvortrag: The complexity of negation-limited networks - A brief survey , 1975, Automata Theory and Formal Languages.

[51]  Alexander A. Razborov,et al.  On the Shrinkage Exponent for Read-Once Formulae , 1995, Theor. Comput. Sci..

[52]  Benjamin Rossman,et al.  Correlation Bounds Against Monotone NC^1 , 2015, CCC.