NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth

@article{Wang2011NEXPDN,
  title={NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth},
  author={Fengming Wang},
  journal={Electron. Colloquium Comput. Complex.},
  year={2011},
  volume={18},
  pages={17}
}
  • Fengming Wang
  • Published 23 May 2011
  • Computer Science
  • Electron. Colloquium Comput. Complex.
ACCm circuits are circuits consisting of unbounded fan-in AND, OR and MODm gates and unary NOT gates, where m is a fixed integer. We show that there exists a language in non-deterministic exponential time which can not be computed by any non-uniform family of ACCm circuits of quasipolynomial size and o(log log n) depth, where m is an arbitrarily chosen constant. 
View via Publisher
eccc.hpi-web.de
10 Citations
Background Citations
3

10 Citations

Citation Type

Citation Type

Nonuniform ACC Circuit Lower Bounds
TLDR
The high-level strategy is to design faster algorithms for the circuit satisfiability problem over ACC circuits, then prove that such algorithms entail these lower bounds, while the second step requires a strengthening of the author’s prior work.
A Satisfiability Algorithm for Depth Two Circuits with a Sub-Quadratic Number of Symmetric and Threshold Gates
  • Suguru Tamaki
  • Computer Science
    Electron. Colloquium Comput. Complex.
  • 2016
TLDR
A deterministic algorithm that, given a circuit with n variables andm gates, counts the number of satisfying assignments in time 2 n−Ω, which runs in time super-polynomially faster than 2 n if m= O(n2/ logbn) for some constant b> 0.
Non-uniform ACC Circuit Lower Bounds
  • Ryan Williams
  • Computer Science
    2011 IEEE 26th Annual Conference on Computational Complexity
  • 2011
TLDR
The high-level strategy is to design faster algorithms for the circuit satisfiability problem over ACC circuits, then prove that such algorithms can be applied to obtain the above lower bounds.
Depth-Reduction for Composites
TLDR
A new depth-reduction construction is obtained, which implies a super-exponential improvement in the depth lower bound separating NEXP from non-uniform ACC, and it is shown that every circuit with AND, OR, NOT, and MODm gates can be reduced to a depth-2, SYM-AND circuit.
Circuits with composite moduli
TLDR
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) .
Circuit Complexity: New Techniques and Their Limitations
TLDR
The weighted gate elimination method is introduced, which runs a more sophisticated induction than gate elimination, and it is shown that this method gives a much simpler proof of a stronger lower bound of 3.11n for quadratic dispersers.
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression
TLDR
This paper presents algorithms for the circuit satisfiability problem of bounded depth circuits with AND, OR, NOT gates and a limited number of weighted symmetric gates that run in time super-polynomially faster than 2^n even when the number of gates is super- polynomial and the maximum weight of asymmetric gates is nearly exponential.
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework
TLDR
This paper provides a general framework for proving worst/average case lower bounds for circuits and upper bounds for #SAT that is built on ideas of Chen and Kabanets, and shows that many known proofs (of circuit size lower bounds and higher bounds for#SAT) fall into this framework.
Gate elimination: Circuit size lower bounds and #SAT upper bounds

References

SHOWING 1-10 OF 22 REFERENCES
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
TLDR
It is proved that depth k circuits with gates NOT, OR and MODp where p is a prime require Exp(&Ogr;(n1/2k)) gates to calculate MODr functions for any r ≠ pm.
ON ACC and threshold circuits
  • A. Yao
  • Computer Science
    Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
TLDR
It is proved that any language in ACC can be approximately computed by two-level circuits of size 2 raised to the (log n)/sup k/ power, with a symmetric-function gate at the top and only AND gates on the first level, giving the first nontrivial upper bound on the computing power of ACC circuits.
Non-uniform ACC Circuit Lower Bounds
  • Ryan Williams
  • Computer Science
    2011 IEEE 26th Annual Conference on Computational Complexity
  • 2011
TLDR
The high-level strategy is to design faster algorithms for the circuit satisfiability problem over ACC circuits, then prove that such algorithms can be applied to obtain the above lower bounds.
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
We show that the permanent cannot be computed by DLOGTIME-uniform threshold or arithmetic circuits of depth o(log log n) and polynomial size.
Quasipolynomial size circuit classes
  • D. M. Barrington
  • Computer Science
    [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference
  • 1992
TLDR
The author summarizes the reasons for thinking about the complexity classes so introduced, surveys these results and gives an overview of these classes, and shows that the Barrington-Immerman-Straubing uniformity definition for polynomial-size classes can easily be extended to quasipolynomial size.
Almost optimal lower bounds for small depth circuits
  • J. Håstad
  • Computer Science, Mathematics
    STOC '86
  • 1986
TLDR
Improved lower bounds for the size of small depth circuits computing several functions are given and it is shown that there are functions computable in polynomial size and depth k but requires exponential size when the depth is restricted to k 1.
Optimal bounds for decision problems on the CRCW PRAM
TLDR
Lower bounds on the time for CRCW PRAM's with polynomially bounded numbers of processors or memory cells to compute parity and a number of related problems are proved and almost all Boolean functions of n bits require log n - log log n + time when the number of processors is at most polynomial in n.
In search of an easy witness: exponential time vs. probabilistic polynomial time
The Permanent Requires Large Uniform Threshold Circuits
  • E. Allender
  • Computer Science
    Chic. J. Theor. Comput. Sci.
  • 1999
TLDR
It is shown that the permanent cannot be computed by uniform constantdepth threshold circuits of size T (n), for any function T such that for all k, T ( n) = o(2), and any problem that is hard for the complexity class C=P requires circuits of this size.
On ACC
TLDR
It is shown that every languageL in the class ACC can be recognized by depth-two deterministic circuits with a symmetric-function gate at the root and polynomialspn overZ of degree logO(1)n and with coefficients of magnitude.
...
1
2
3
...