Name
Abstract | ||
|---|---|---|
The authors use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width branching programs to solve a number of problems. In particular, they show that any bounded-width branching program computing a nonconstant threshold function has length Ω( n log log n), improving on the previous lower bounds known to apply to all such threshold functions. They also show that any program over a finite solvable monoid computing products in a nonsolvable group has length Ω(n log log n). This result is a step toward proving the conjecture that the circuit complexity class ACC0 is properly contained in NC1 |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1006/jcss.1995.1029 | Journal of Computer and System Sciences |
Keywords | DocType | Volume |
nonconstant threshold function,circuit complexity class acc,algebraic technique,previous lower bound,finite solvable monoid computing,step toward1proving,superlinear lower bounds,lower bound,nonsolvable group,n loglog n,bounded-width branching programs,threshold function,superlinear lower bound | Conference | 50 |
Issue | ISSN | Citations |
3 | Journal of Computer and System Sciences | 25 |
PageRank | References | Authors |
1.70 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David A. Mix Barrington | 1 | 856 | 94.79 |
| Howard Straubing | 2 | 528 | 60.92 |