# An Average-Case Depth Hierarchy Theorem for Boolean Circuits

```@article{Rossman2015AnAD,
title={An Average-Case Depth Hierarchy Theorem for Boolean Circuits},
author={Benjamin Rossman and Rocco A. Servedio and Li-Yang Tan},
journal={2015 IEEE 56th Annual Symposium on Foundations of Computer Science},
year={2015},
pages={1030-1048}
}```
• Published 13 April 2015
• Mathematics, Computer Science
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of AND, OR, and NOT gates. Our hierarchy theorem says that for every d ≥ 2, there is an explicit n-variable Boolean function f, computed by a linear-size depth-d formula, which is such that any depth-(d - 1) circuit that agrees with f on (1/2 + on(1)) fraction of all inputs must have size exp(nΩ(1/d)). This answers an open question posed by Hastad in his Ph.D. thesis [Has86b]. Our average-case depth…
48 Citations
An Average-Case Depth Hierarchy Theorem for Boolean Circuits
• Mathematics, Computer Science
J. ACM
• 2017
The average-case depth hierarchy theorem implies that the polynomial hierarchy is infinite relative to a random oracle with probability 1, confirming a conjecture of Håstad (1986a), Cai (1986), and Babai (1987).
A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem
• Mathematics, Computer Science
STOC
• 2019
It is shown that for any fixed d, the class Cd,k of functions that have uniform AC0[⊕] formulas of depth d and size nk form an infinite hierarchy.
Constant Depth Formula and Partial Function
This work makes progress, on two fronts, towards showing MCSP is intractable under worst-case assumptions, and formulates a notion of lower bound statements being (P/poly)-recognizable that is closely related to Razborov and Rudich’s definition of being ( P/ poly)-constructive.
Constant Depth Formula and Partial Function Versions of MCSP are Hard
• Rahul Ilango
• Computer Science
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
• 2020
This work makes progress, on two fronts, towards showing MCSP is intractable under worst-case assumptions, and formulates a notion of lower bound statements being (P/poly)-recognizable that is closely related to Razborov and Rudich's definition of being ( P/ poly)-constructive.
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
• Computer Science, Mathematics
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
• 2022
It is observed that the first super polynomial lower bounds against general algebraic circuits of all constant depths over all fields of characteristic 0 implies the first deterministic sub-exponential time algorithm for solving the Polynomial Identity Testing (PIT) problem for all small depth circuits using the known connection between algebraic hardness and randomness.
On the Probabilistic Degree of an n-variate Boolean Function
• Computer Science, Mathematics
Electron. Colloquium Comput. Complex.
• 2021
This paper shows that if the probabilistic degree of OR is ( log n ) c, then the minimum possible probabilism degree of such an f is at least ( logn ) c / ( c + 1 ) − o ( 1 ) , and it is shown that this is tight up to (log n ) o (1 ) factors.
Circuits with composite moduli
The main result is that every ACC circuit of polynomial size and depth d can be reduced to a depth-2 circuit SYM◦AND of size 2(logn)O(d) , which improves exponentially the previously best-known construction by Yao-Beigel-Tarui, which has size blowup 2 2O( d) .
Finer separations between shallow arithmetic circuits
• Mathematics, Computer Science
Electron. Colloquium Comput. Complex.
• 2016
The proofs are much shorter and simpler than the two known proofs of n^{Omega(sqrt(d))} lower bound for homogeneous depth-4 circuits, albeit the proofs only work when d = O(log^2(n), which shows that the parameters of depth reductions are optimal for algebraic branching programs.
Poly-logarithmic Frege depth lower bounds via an expander switching lemma
• Mathematics, Computer Science
STOC
• 2016
We show that any polynomial-size Frege refutation of a certain linear-size unsatisfiable 3-CNF formula over n variables must have depth Ω(√logn). This is an exponential improvement over the previous
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits
• Computer Science, Mathematics
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
• 2018
Two separating examples may be viewed as algebraic analogues of variants of the Graph Reachability problem studied by Chen, Oliveira, Servedio and Tan (STOC 2016), who used them to prove lower bounds for constant-depth Boolean circuits.