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

2025-11-17

AI Summary

This paper addresses the algebraization barrier in circuit lower-bound proofs. Method: Leveraging the communication complexity of the XOR-Missing-String problem as a novel tool, it systematically constructs three classes of oracles admitting multilinear polynomial extensions—first integrating communication-complexity analysis, multilinear polynomial extension, and hierarchical oracle construction to transcend the single-extension paradigm of traditional algebraic frameworks. Contributions: (1) It proves that PostBPE and BPE are simulatable by linear-size circuits relative to algebraic oracles, demonstrating the impossibility of algebraic lower bounds for these classes. (2) It shows that a natural subclass of MA_E is simulatable by super-half-exponential-size circuits, thereby exposing the inherent limitation of existing algebraic techniques to surpass half-exponential lower bounds. (3) It establishes the first general paradigm for characterizing the “algebraization barrier” in circuit complexity—grounded explicitly in communication problems.

Technology Category

• Machine Learning: Probabilistic Circuits and Graphical Models
• Search and Optimization: Sampling/Simulation-based Search
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Security and Privacy: Large-scale security measurements
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

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_1, dots, x_min{0, 1}^n$, Bob gets a list of $m$ strings $y_1, dots, y_min{0, 1}^n$, and the goal is to output a string $sin{0, 1}^n$ that is not equal to $x_ioplus y_j$ for any $i, jin [m]$. 1. We construct an oracle $A_1$ and its multilinear extension $widetilde{A_1}$ such that ${sf PostBPE}^{widetilde{A_1}}$ has linear-size $A_1$-oracle circuits on infinitely many input lengths. 2. We construct an oracle $A_2$ and its multilinear extension $widetilde{A_2}$ such that ${sf BPE}^{widetilde{A_2}}$ has linear-size $A_2$-oracle circuits on all input lengths. 3. Finally, we study algebrization barriers to circuit lower bounds for $sf MA_E$. Buhrman, Fortnow, and Thierauf proved a *sub-half-exponential* circuit lower bound for $sf MA_E$ via algebrizing techniques. Toward understanding whether the half-exponential bound can be improved, we define a natural subclass of $sf MA_E$ that includes their hard $sf MA_E$ language, and prove the following result: For every *super-half-exponential* function $h(n)$, we construct an oracle $A_3$ and its multilinear extension $widetilde{A_3}$ such that this natural subclass of ${sf MA}_{sf E}^{widetilde{A_3}}$ has $h(n)$-size $A_3$-oracle circuits on all input lengths.

Problem

• Establishing new algebrization barriers for circuit lower bounds via communication complexity
• Studying XOR-Missing-String problem to construct oracles that limit circuit lower bounds
• Exploring algebrization barriers for MA_E complexity class and super-half-exponential functions

Innovation

• Uses communication complexity of XOR-Missing-String problem
• Constructs oracles with multilinear extensions for circuits
• Establishes barriers via oracle circuits for complexity classes