How to multiply matrices faster
How to multiply matrices faster
Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
A note on succinct representations of graphs
Information and Control
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
NP is as easy as detecting unique solutions
Theoretical Computer Science
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
The monotone circuit complexity of Boolean functions
Combinatorica
Short propositional formulas represent nondeterministic computations
Information Processing Letters
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
On the method of approximations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Non-uniform automata over groups
Information and Computation
An O(T log T) reduction from RAM computations to satisfiability
Theoretical Computer Science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
A circuit-based proof of Toda's theorem
Information and Computation
Exponential size lower bounds for some depth three circuits
Information and Computation
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
Journal of Computer and System Sciences
Superlinear lower bounds for bounded-width branching programs
Journal of Computer and System Sciences
The power of the middle bit of a #P function
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Computational Complexity - Special issue on circuit complexity
Circuits constructed with MODq gates cannot compute “AND” in sublinear size
Computational Complexity - Special issue on circuit complexity
A note on a theorem of Barrington, Straubing and The´rien
Information Processing Letters
On the computational power of depth-2 circuits with threshold and modulo gates
Theoretical Computer Science
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Rectangular matrix multiplication revisited
Journal of Complexity
A lower bound for depth-3 circuits with MOD m gates
Information Processing Letters
Fast rectangular matrix multiplication and applications
Journal of Complexity
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
On TC0, AC0, and arithmetic circuits
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Lower Bounds for (MODp - MODm) Circuits
SIAM Journal on Computing
Explicit lower bound of 4.5n - o(n) for boolena circuits
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
A Duality between Clause Width and Clause Density for SAT
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Lower bounds for circuits with MOD_m gates
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
A note on the power of threshold circuits
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
The Complexity of Satisfiability of Small Depth Circuits
Parameterized and Exact Computation
Linear Systems over Composite Moduli
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A New Characterization of ACC0 and Probabilistic CC0
Computational Complexity - Selected papers from the 24th Annual IEEE Conference on Computational Complexity (CCC 2009)
Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Nexp does not have non-uniform quasipolynomial-size ACC circuits of o(log log n) depth
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
A satisfiability algorithm for AC0
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m 1 is an arbitrary constant. We prove the following. ---NEXP, the class of languages accepted in nondeterministic exponential time, does not have nonuniform ACC circuits of polynomial size. The size lower bound can be slightly strengthened to quasipolynomials and other less natural functions. ---ENP, the class of languages recognized in 2O(n) time with an NP oracle, doesn’t have nonuniform ACC circuits of 2no(1) size. The lower bound gives an exponential size-depth tradeoff: for every d, m there is a δ 0 such that ENP doesn’t have depth-d ACC circuits of size 2nδ with MODm gates. Previously, it was not known whether EXPNP had depth-3 polynomial-size circuits made out of only MOD6 gates. 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. The algorithms combine known properties of ACC with fast rectangular matrix multiplication and dynamic programming, while the second step requires a strengthening of the author’s prior work.