Document Open Access Logo

A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates

Authors Ivan Mihajlin, Anastasia Sofronova

PDF
Thumbnail PDF

File

LIPIcs.CCC.2022.13.pdf
  • Filesize: 0.69 MB
  • 15 pages

Document Identifiers

Author Details

Ivan Mihajlin
  • Leonhard Euler International Mathematical Institute in Saint Petersburg, Russia
Anastasia Sofronova
  • Leonhard Euler International Mathematical Institute in Saint Petersburg, Russia
  • St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences, Russia

Funding

  • Mihajlin, Ivan: The work is supported by Ministry of Science and Higher Education of the Russian Federation, agreement numero 075-15-2019-1620.
  • Sofronova, Anastasia: The work is supported by Ministry of Science and Higher Education of the Russian Federation, agreement numero 075-15-2019-1620, as well as by the Theoretical Physics and Mathematics Advancement Foundation <<BASIS>>, agreement numero 21-7-1-20-4.

Acknowledgements

The authors would like to thank Kaave Hosseini for his invaluable insights on Lemma 27, Alexander Kulikov, Alexander Smal and Artur Riazanov for fruitful discussions and comments on the draft. The authors would also like to thank anonymous reviewers.

Cite AsGet BibTex

Ivan Mihajlin and Anastasia Sofronova. A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates. In 37th Computational Complexity Conference (CCC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 234, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.CCC.2022.13

Abstract

We prove that a modification of Andreev’s function is not computable by (3 + α - ε) log(n) depth De Morgan formula with (2α - ε)log{n} layers of AND gates at the top for any 0 < α < 1/5 and any constant ε > 0. In order to do this, we prove a weak variant of Karchmer-Raz-Wigderson conjecture. To be more precise, we prove the existence of two functions f : {0,1}ⁿ → {0,1} and g : {0,1}ⁿ → {0,1}ⁿ such that f(g(x) ⊕ y) is not computable by depth (1 + α - ε) n formulas with (2 α - ε) n layers of AND gates at the top. We do this by a top-down approach, which was only used before for depth-3 model. Our technical contribution includes combinatorial insights into structure of composition with random boolean function, which led us to introducing a notion of well-mixed sets. A set of functions is well-mixed if, when composed with a random function, it does not have subsets that agree on large fractions of inputs. We use probabilistic method to prove the existence of well-mixed sets.

Subject Classification

ACM Subject Classification
  • Theory of computation → Circuit complexity
Keywords
  • formula complexity
  • communication complexity
  • Karchmer-Raz-Wigderson conjecture
  • De Morgan formulas

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Alexander E. Andreev. On a method for obtaining more than quadratic effective lower bounds for the complexity of π-schemes. Moscow University Mathematics Bulletin, 42(1):24-29, 1987. Google Scholar
  2. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, and Robert Robere. KRW composition theorems via lifting. In Sandy Irani, editor, 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pages 43-49. IEEE, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00013.
  3. Irit Dinur and Or Meir. Toward the KRW composition conjecture: Cubic formula lower bounds via communication complexity. In Ran Raz, editor, 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, volume 50 of LIPIcs, pages 3:1-3:51. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. URL: https://doi.org/10.4230/LIPIcs.CCC.2016.3.
  4. Jeff Edmonds, Russell Impagliazzo, Steven Rudich, and Jirí Sgall. Communication complexity towards lower bounds on circuit depth. Comput. Complex., 10(3):210-246, 2001. URL: https://doi.org/10.1007/s00037-001-8195-x.
  5. Dmitry Gavinsky, Or Meir, Omri Weinstein, and Avi Wigderson. Toward better formula lower bounds: The composition of a function and a universal relation. SIAM J. Comput., 46(1):114-131, 2017. URL: https://doi.org/10.1137/15M1018319.
  6. Johan Håstad. The shrinkage exponent of de morgan formulas is 2. SIAM J. Comput., 27(1):48-64, 1998. URL: https://doi.org/10.1137/S0097539794261556.
  7. Johan Håstad and Avi Wigderson. Composition of the universal relation. In Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990, pages 119-134, 1990. URL: https://doi.org/10.1090/dimacs/013/07.
  8. Russell Impagliazzo, Raghu Meka, and David Zuckerman. Pseudorandomness from shrinkage. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pages 111-119. IEEE, 2012. Google Scholar
  9. Russell Impagliazzo and Noam Nisan. The effect of random restrictions on formula size. Random Struct. Algorithms, 4:121-134, 1993. Google Scholar
  10. Mauricio Karchmer, Ran Raz, and Avi Wigderson. Super-logarithmic depth lower bounds via the direct sum in communication complexity. Computational Complexity, 5(3/4):191-204, 1995. URL: https://doi.org/10.1007/BF01206317.
  11. Mauricio Karchmer and Avi Wigderson. Monotone circuits for connectivity require super-logarithmic depth. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pages 539-550, 1988. URL: https://doi.org/10.1145/62212.62265.
  12. Valeriy Mihailovich Khrapchenko. Complexity of the realization of a linear function in the class of II-circuits. Mathematical Notes of the Academy of Sciences of the USSR, 9(1):21-23, 1971. Google Scholar
  13. Sajin Koroth and Or Meir. Improved composition theorems for functions and relations. In Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA, volume 116 of LIPIcs, pages 48:1-48:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.48.
  14. Ivan Mihajlin and Alexander Smal. Toward better depth lower bounds: The XOR-KRW conjecture. In Valentine Kabanets, editor, 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference), volume 200 of LIPIcs, pages 38:1-38:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.CCC.2021.38.
  15. Michael S. Paterson and Uri Zwick. Shrinkage of de morgan formulae under restriction. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, SFCS '91, pages 324-333, USA, 1991. IEEE Computer Society. URL: https://doi.org/10.1109/SFCS.1991.185385.
  16. J. Riordan and C. Shannon. The number of two-terminal series-parallel networks. J Math Phys, 21, January 1942. URL: https://doi.org/10.1002/sapm194221183.
  17. Bella Abramovna Subbotovskaya. Realization of linear functions by formulas using ∧, ∨, ¬. In Doklady Akademii Nauk, volume 136-3, pages 553-555. Russian Academy of Sciences, 1961. Google Scholar
  18. Avishay Tal. Shrinkage of de morgan formulae by spectral techniques. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, pages 551-560, December 2014. URL: https://doi.org/10.1109/FOCS.2014.65.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact