Constant Width Planar Branching Programs Characterize ACC 0 in Quasipolynomial Size (original) (raw)
Related papers
1995
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences, 1989
Information and Computation, 1992
Superlinear Lower Bounds for Bounded-Width Branching Programs
Journal of Computer and System Sciences, 1995
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials
Chic. J. Theor. Comput. Sci., 2019
Restricted branching programs and hardware verification
1995
On the Power of Randomized Ordered Branching Programs
Electronic Colloquium on Computational Complexity, 1998
Demystifying the border of depth-3 algebraic circuits
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022
Bounds for Width Two Branching Programs
SIAM Journal on Computing, 1986
Nondeterministic NC¹ computation
1998
A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
Mathematical Systems Theory, 1994
Relating Branching Program Size and Formula Size over the Full Binary Basis
1999
On computational power of quantum branching programs
2001
A lower bound for integer multiplication with read-once branching programs
1995
On the power of randomized branching programs
1996
On the Power of Randomized Ordered Branching Programs DRAFT
1997
Quantum and Stochastic Branching Programs of Bounded Width
Lecture Notes in Computer Science, 2002
2006
Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
Some results on uniform arithmetic circuit complexity
Mathematical Systems Theory, 1994
On Threshold Circuits and Polynomial Computation
SIAM Journal on Computing, 1992
Lower bound frontiers in arithmetical circuit complexity
2006
On the computational power of probabilistic and quantum branching program
Information and Computation, 2005
On TC0, AC0, and Arithmetic Circuits
Journal of Computer and System Sciences, 2000
Journal of Computer and System Sciences, 1981
On the Computational Power of Probabilistic and Quantum Branching Programs (Revised Version)
2000
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results