Document Open Access Logo

Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function

Authors Nikolai Chukhin, Alexander S. Kulikov , Ivan Mihajlin

PDF
Thumbnail PDF

File

LIPIcs.STACS.2025.26.pdf
  • Filesize: 0.74 MB
  • 15 pages

Document Identifiers

Author Details

Nikolai Chukhin
  • Neapolis University Pafos, Cyprus
  • JetBrains Research, Paphos, Cyprus
Alexander S. Kulikov
  • JetBrains Research, Paphos, Cyprus
Ivan Mihajlin
  • JetBrains Research, Paphos, Cyprus

Cite As Get BibTex

Nikolai Chukhin, Alexander S. Kulikov, and Ivan Mihajlin. Toward Better Depth Lower Bounds: Strong Composition of XOR and a Random Function. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.STACS.2025.26

Abstract

Proving formula depth lower bounds is a fundamental challenge in complexity theory, with the strongest known bound of (3 - o(1))log n established by Håstad over 25 years ago. The Karchmer-Raz-Wigderson (KRW) conjecture offers a promising approach to advance these bounds and separate P from NC¹. It suggests that the depth complexity of a function composition f ⋄ g approximates the sum of the depth complexities of f and g.
The Karchmer-Wigderson (KW) relation framework translates formula depth into communication complexity, restating the KRW conjecture as CC(KW_f ⋄ KW_g) ≈ CC(KW_f) + CC(KW_g). Prior work has confirmed the conjecture under various relaxations, often replacing one or both KW relations with the universal relation or constraining the communication game through strong composition.
In this paper, we examine the strong composition KW_XOR ⊛ KW_f of the parity function and a random Boolean function f. We prove that with probability 1-o(1), any protocol solving this composition requires at least n^{3 - o(1)} leaves. This result establishes a depth lower bound of (3 - o(1))log n, matching Håstad’s bound, but is applicable to a broader class of inner functions, even when the outer function is simple. Though bounds for the strong composition do not translate directly to formula depth bounds, they usually help to analyze the standard composition (of the corresponding two functions) which is directly related to formula depth.
Our proof utilizes formal complexity measures. First, we apply Khrapchenko’s method to show that numerous instances of f remain unsolved after several communication steps. Subsequently, we transition to a different formal complexity measure to demonstrate that the remaining communication problem is at least as hard as KW_OR ⊛ KW_f. This hybrid approach not only achieves the desired lower bound, but also introduces a novel technique for analyzing formula depth, potentially informing future research in complexity theory.

Subject Classification

ACM Subject Classification
  • Theory of computation → Circuit complexity
Keywords
  • complexity
  • formula complexity
  • lower bounds
  • Boolean functions
  • depth

Metrics

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

References

  1. Maria Luisa Bonet and Samuel R. Buss. Size-depth tradeoffs for boolean fomulae. Inf. Process. Lett., 49(3):151-155, 1994. URL: https://doi.org/10.1016/0020-0190(94)90093-0.
  2. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, and Robert Robere. KRW composition theorems via lifting. Comput. Complex., 33(1):4, 2024. URL: https://doi.org/10.1007/s00037-024-00250-7.
  3. Irit Dinur and Or Meir. Toward the KRW composition conjecture: Cubic formula lower bounds via communication complexity. Comput. Complex., 27(3):375-462, 2018. URL: https://doi.org/10.1007/s00037-017-0159-x.
  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 Jin-Yi Cai, editor, Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, New Jersey, USA, December 3-7, 1990, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 119-134. DIMACS/AMS, 1990. URL: https://doi.org/10.1090/dimacs/013/07.
  8. Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, and Pavel Pudlák. On convex complexity measures. Theor. Comput. Sci., 411(16-18):1842-1854, 2010. URL: https://doi.org/10.1016/j.tcs.2010.02.004.
  9. Russell Impagliazzo and Noam Nisan. The effect of random restrictions on formula size. Random Struct. Algorithms, 4(2):121-134, 1993. URL: https://doi.org/10.1002/rsa.3240040202.
  10. Stasys Jukna. Boolean Function Complexity - Advances and Frontiers, volume 27 of Algorithms and combinatorics. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-24508-4.
  11. Mauricio Karchmer, Ran Raz, and Avi Wigderson. Super-logarithmic depth lower bounds via the direct sum in communication complexity. Comput. Complex., 5(3/4):191-204, 1995. URL: https://doi.org/10.1007/BF01206317.
  12. Mauricio Karchmer and Avi Wigderson. Monotone circuits for connectivity require super-logarithmic depth. SIAM J. Discret. Math., 3(2):255-265, 1990. URL: https://doi.org/10.1137/0403021.
  13. V. M. Khrapchenko. Method of determining lower bounds for the complexity of p-schemes. Mathematical notes of the Academy of Sciences of the USSR, 10(1):474-479, 1971. URL: https://doi.org/10.1007/BF01747074.
  14. Or Meir. Toward better depth lower bounds: A krw-like theorem for strong composition. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pages 1056-1081. IEEE, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00064.
  15. 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.
  16. Mike Paterson and Uri Zwick. Shrinkage of de morgan formulae under restriction. Random Struct. Algorithms, 4(2):135-150, 1993. URL: https://doi.org/10.1002/rsa.3240040203.
  17. B. A. Subbotovskaya. Realization of linear functions by formulas using ∨, &, ^-. Dokl. Akad. Nauk SSSR, 136(3):553-555, 1961. URL: http://mi.mathnet.ru/dan24539.
  18. Avishay Tal. Shrinkage of de morgan formulae by spectral techniques. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pages 551-560. IEEE Computer Society, 2014. URL: https://doi.org/10.1109/FOCS.2014.65.
  19. Ingo Wegener. The complexity of Boolean functions. Wiley-Teubner, 1987. URL: http://ls2-www.cs.uni-dortmund.de/monographs/bluebook/.
  20. Hao Wu. An improved composition theorem of a universal relation and most functions via effective restriction. CoRR, abs/2310.07422, 2023. URL: https://doi.org/10.48550/arXiv.2310.07422.
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 About DROPS Imprint Privacy Contact