Nexp does not have non-uniform quasipolynomial-size ACC circuits of o(log log n) depth

Authors:
Fengming Wang
Affiliations:
Department of Computer Science, Rutgers University, New Brunswick, NJ
Venue:
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Year:
2011

Citing 14
Cited 1

Almost optimal lower bounds for small depth circuits

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algebraic methods in the theory of lower bounds for Boolean circuit complexity

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Optimal bounds for decision problems on the CRCW PRAM

Journal of the ACM (JACM)
A Uniform Circuit Lower Bound For the Permanent

SIAM Journal on Computing
When do extra majority gates help?: polylog(N) majority gates are equivalent to one

Computational Complexity - Special issue on circuit complexity
On ACC

Computational Complexity - Special issue on circuit complexity
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
In search of an easy witness: exponential time vs. probabilistic polynomial time

Journal of Computer and System Sciences - Complexity 2001
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate

ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
ON ACC and threshold circuits

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Improving exhaustive search implies superpolynomial lower bounds

Proceedings of the forty-second ACM symposium on Theory of computing
Non-uniform ACC Circuit Lower Bounds

CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity

Nonuniform ACC Circuit Lower Bounds

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.