Document Open Access Logo

New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String

Authors Lijie Chen , Yang Hu , Hanlin Ren

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITCS.2026.37.pdf
  • Filesize: 0.9 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Complexity classes
  • Theory of computation → Circuit complexity
  • Theory of computation → Communication complexity
Keywords
  • circuit lower bound
  • algebrization barrier
  • missing string
  • communication complexity

Metrics

Abstract

The algebrization barrier, proposed by Aaronson and Wigderson (STOC '08, ToCT '09), captures the limitations of many complexity-theoretic techniques based on arithmetization. Notably, several circuit lower bounds that overcome the relativization barrier (Buhrman-Fortnow-Thierauf, CCC '98; Vinodchandran, TCS '05; Santhanam, STOC '07, SICOMP '09) remain subject to the algebrization barrier. 
In this work, we establish several new algebrization barriers to circuit lower bounds by studying the communication complexity of the following problem, called XOR-Missing-String: For m < 2^{n/2}, Alice gets a list of m strings x₁, … , x_m ∈ {0, 1}ⁿ, Bob gets a list of m strings y₁, … , y_m ∈ {0, 1}ⁿ, and the goal is to output a string s ∈ {0, 1}ⁿ that is not equal to x_i⊕ y_j for any i, j ∈ [m]. 
1) We construct an oracle A₁ and its multilinear extension A₁̃ such that PostBPE^{A₁̃} has linear-size A₁-oracle circuits on infinitely many input lengths. That is, proving PostBPE ̸ ⊆ i.o.- SIZE[O(n)] requires non-algebrizing techniques. This barrier follows from a PostBPP communication lower bound for XOR-Missing-String. This is in contrast to the well-known algebrizing lower bound MA_E (⊆ PostBPE) ̸ ⊆ P/_poly.
2) We construct an oracle A₂ and its multilinear extension A₂̃ such that BPE^{A₂̃} has linear-size A₂-oracle circuits on all input lengths. Previously, a similar barrier was demonstrated by Aaronson and Wigderson, but in their result, A₂̃ is only a multiquadratic extension of A₂. Our results show that communication complexity is more useful than previously thought for proving algebrization barriers, as Aaronson and Wigderson wrote that communication-based barriers were "more contrived". This serves as an example of how XOR-Missing-String forms new connections between communication lower bounds and algebrization barriers. 
3) Finally, we study algebrization barriers to circuit lower bounds for MA_E. Buhrman, Fortnow, and Thierauf proved a sub-half-exponential circuit lower bound for MA_E via algebrizing techniques. Toward understanding whether the half-exponential bound can be improved, we define a natural subclass of MA_E that includes their hard MA_E language, and prove the following result: For every super-half-exponential function h(n), we construct an oracle A₃ and its multilinear extension A₃̃ such that this natural subclass of MA_E^{A₃̃} has h(n)-size A₃-oracle circuits on all input lengths. This suggests that half-exponential might be the correct barrier for MA_E circuit lower bounds w.r.t. algebrizing techniques.

Cite As Get BibTex

Lijie Chen, Yang Hu, and Hanlin Ren. New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String. In 17th Innovations in Theoretical Computer Science Conference (ITCS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 362, pp. 37:1-37:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ITCS.2026.37

Author Details

Lijie Chen
  • University of California, Berkeley, CA, USA
Yang Hu
  • Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China
Hanlin Ren
  • Institute for Advanced Study, Princeton, NJ, USA

References

  1. Scott Aaronson. Quantum computing, postselection, and probabilistic polynomial-time. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 461(2063):3473-3482, 2005. URL: https://doi.org/10.1098/rspa.2005.1546.
  2. Scott Aaronson. Oracles are subtle but not malicious. In Conference on Computational Complexity (CCC), pages 340-354. IEEE Computer Society, 2006. URL: https://doi.org/10.1109/CCC.2006.32.
  3. Scott Aaronson and Avi Wigderson. Algebrization: A new barrier in complexity theory. ACM Trans. Comput. Theory, 1(1):2:1-2:54, 2009. URL: https://doi.org/10.1145/1490270.1490272.
  4. Eric Allender. Oracles versus proof techniques that do not relativize. In SIGAL International Symposium on Algorithms, volume 450 of Lecture Notes in Computer Science, pages 39-52. Springer, 1990. URL: https://doi.org/10.1007/3-540-52921-7_54.
  5. Sanjeev Arora and Boaz Barak. Computational Complexity - A Modern Approach. Cambridge University Press, 2009. URL: https://doi.org/10.1017/CBO9780511804090.
  6. Sanjeev Arora, Russell Impagliazzo, and Umesh Vazirani. Relativizing versus nonrelativizing techniques: the role of local checkability. Manuscript, 1992. URL: https://people.eecs.berkeley.edu/~vazirani/pubs/relativizing.pdf.
  7. Barış Aydınlıoğlu and Eric Bach. Affine relativization: Unifying the algebrization and relativization barriers. ACM Trans. Comput. Theory, 10(1):1:1-1:67, 2018. URL: https://doi.org/10.1145/3170704.
  8. László Babai, Lance Fortnow, and Carsten Lund. Non-deterministic exponential time has two-prover interactive protocols. Comput. Complex., 1:3-40, 1991. URL: https://doi.org/10.1007/BF01200056.
  9. László Babai, Lance Fortnow, Noam Nisan, and Avi Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307-318, 1993. URL: https://doi.org/10.1007/BF01275486.
  10. Theodore P. Baker, John Gill, and Robert Solovay. Relativizations of the P = ? NP question. SIAM J. Comput., 4(4):431-442, 1975. URL: https://doi.org/10.1137/0204037.
  11. Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, and Christino Tamon. Oracles and queries that are sufficient for exact learning. J. Comput. Syst. Sci., 52(3):421-433, 1996. URL: https://doi.org/10.1006/jcss.1996.0032.
  12. Harry Buhrman, Lance Fortnow, and Thomas Thierauf. Nonrelativizing separations. In CCC, pages 8-12, 1998. URL: https://doi.org/10.1109/CCC.1998.694585.
  13. Jin-yi Cai. S₂^p ⊆ ZPP^NP. J. Comput. Syst. Sci., 73(1):25-35, 2007. URL: https://doi.org/10.1016/j.jcss.2003.07.015.
  14. Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, and Mitsunori Ogihara. Competing provers yield improved Karp-Lipton collapse results. Inf. Comput., 198(1):1-23, 2005. URL: https://doi.org/10.1016/j.ic.2005.01.002.
  15. Lijie Chen, Shuichi Hirahara, and Hanlin Ren. Symmetric exponential time requires near-maximum circuit size. In STOC, pages 1990-1999. ACM, 2024. URL: https://doi.org/10.1145/3618260.3649624.
  16. Lijie Chen, Jiatu Li, and Jingxun Liang. Maximum circuit lower bounds for exponential-time arthur merlin. In STOC, pages 1348-1358. ACM, 2025. URL: https://doi.org/10.1145/3717823.3718224.
  17. Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, and Rahul Santhanam. Polynomial-time pseudodeterministic construction of primes. In FOCS, pages 1261-1270. IEEE, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00074.
  18. Lijie Chen, Dylan M. McKay, Cody D. Murray, and R. Ryan Williams. Relations and equivalences between circuit lower bounds and Karp-Lipton theorems. In CCC, volume 137 of LIPIcs, pages 30:1-30:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.CCC.2019.30.
  19. Lance Fortnow. The role of relativization in complexity theory. Bull. EATCS, 52:229-243, 1994. Google Scholar
  20. Eran Gat and Shafi Goldwasser. Probabilistic search algorithms with unique answers and their cryptographic applications. Electronic Colloquium on Computational Complexity (ECCC), 18:136, 2011. URL: https://eccc.weizmann.ac.il/report/2011/136.
  21. Oded Goldreich. Computational complexity - a conceptual perspective. Cambridge University Press, 2008. URL: https://doi.org/10.1017/CBO9780511804106.
  22. Mika Göös, Toniann Pitassi, and Thomas Watson. The landscape of communication complexity classes. Comput. Complex., 27(2):245-304, June 2018. URL: https://doi.org/10.1007/s00037-018-0166-6.
  23. Yenjo Han, Lane A. Hemaspaandra, and Thomas Thierauf. Threshold computation and cryptographic security. SIAM J. Comput., 26(1):59-78, 1997. URL: https://doi.org/10.1137/S0097539792240467.
  24. Shuichi Hirahara, Zhenjian Lu, and Hanlin Ren. Bounded relativization. In CCC, volume 264 of LIPIcs, pages 6:1-6:45. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.CCC.2023.6.
  25. Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova. An axiomatic approach to algebrization. In STOC, pages 695-704. ACM, 2009. URL: https://doi.org/10.1145/1536414.1536509.
  26. Russell Impagliazzo, Valentine Kabanets, and Ilya Volkovich. The power of natural properties as oracles. In Computational Complexity Conference (CCC), volume 102 of LIPIcs, pages 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.CCC.2018.7.
  27. Ravi Kannan. Circuit-size lower bounds and non-reducibility to sparse sets. Inf. Control., 55(1-3):40-56, 1982. URL: https://doi.org/10.1016/S0019-9958(82)90382-5.
  28. Richard M. Karp and Richard J. Lipton. Some connections between nonuniform and uniform complexity classes. In Symposium on Theory of Computing (STOC), pages 302-309. ACM, 1980. URL: https://doi.org/10.1145/800141.804678.
  29. H. Klauck. Rectangle size bounds and threshold covers in communication complexity. In 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., pages 118-134, 2003. URL: https://doi.org/10.1109/CCC.2003.1214415.
  30. Robert Kleinberg, Oliver Korten, Daniel Mitropolsky, and Christos Papadimitriou. Total functions in the polynomial hierarchy. In ITCS, volume 185 of LIPIcs, pages 44:1-44:18, 2021. URL: https://doi.org/10.4230/LIPIcs.ITCS.2021.44.
  31. Johannes Köbler and Osamu Watanabe. New collapse consequences of NP having small circuits. SIAM J. Comput., 28(1):311-324, 1998. URL: https://doi.org/10.1137/S0097539795296206.
  32. Oliver Korten. The hardest explicit construction. In Symposium on Foundations of Computer Science (FOCS), pages 433-444. IEEE, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00051.
  33. Zeyong Li. Symmetric exponential time requires near-maximum circuit size: Simplified, truly uniform. In STOC, pages 2000-2007. ACM, 2024. URL: https://doi.org/10.1145/3618260.3649615.
  34. Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, and Rahul Santhanam. On the complexity of avoiding heavy elements. In FOCS, pages 2403-2412. IEEE, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00140.
  35. Carsten Lund, Lance Fortnow, Howard J. Karloff, and Noam Nisan. Algebraic methods for interactive proof systems. J. ACM, 39(4):859-868, 1992. URL: https://doi.org/10.1145/146585.146605.
  36. Peter Bro Miltersen, N. V. Vinodchandran, and Osamu Watanabe. Super-polynomial versus half-exponential circuit size in the exponential hierarchy. In COCOON, volume 1627 of Lecture Notes in Computer Science, pages 210-220. Springer, 1999. URL: https://doi.org/10.1007/3-540-48686-0_21.
  37. Alexander A. Razborov and Steven Rudich. Natural proofs. J. Comput. Syst. Sci., 55(1):24-35, 1997. URL: https://doi.org/10.1006/JCSS.1997.1494.
  38. Hanlin Ren, Rahul Santhanam, and Zhikun Wang. On the range avoidance problem for circuits. In FOCS, pages 640-650. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00067.
  39. Rahul Santhanam. Circuit lower bounds for Merlin-Arthur classes. SIAM J. Comput., 39(3):1038-1061, 2009. URL: https://doi.org/10.1137/070702680.
  40. Adi Shamir. IP = PSPACE. J. ACM, 39(4):869-877, 1992. URL: https://doi.org/10.1145/146585.146609.
  41. Larry J. Stockmeyer and Albert R. Meyer. Cosmological lower bound on the circuit complexity of a small problem in logic. J. ACM, 49(6):753-784, 2002. URL: https://doi.org/10.1145/602220.602223.
  42. N. V. Vinodchandran. A note on the circuit complexity of PP. Theor. Comput. Sci., 347(1-2):415-418, 2005. URL: https://doi.org/10.1016/j.tcs.2005.07.032.
  43. Nikhil Vyas and R. Ryan Williams. On oracles and algorithmic methods for proving lower bounds. In Innovations in Theoretical Computer Science Conference (ITCS), volume 251 of LIPIcs, pages 99:1-99:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.ITCS.2023.99.
  44. Christopher B. Wilson. Relativized circuit complexity. J. Comput. Syst. Sci., 31(2):169-181, 1985. URL: https://doi.org/10.1016/0022-0000(85)90040-6.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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