An exponential lower bound for real-time branching programs
✍ Scribed by Stanislav ák
- Book ID
- 114037769
- Publisher
- Elsevier Science
- Year
- 1986
- Weight
- 415 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0019-9958
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width branching programs to solve a number of problems. In particular, we show that any bounded-width branching program computing a nonconstant threshold function has length \(\Omega(n \log \log n)\), improving on
We prove a lower bound, exponential in the eighth root of the input length, on the size of monotone arithmetic circuits that solve an NP problem related to clique detection. The result is more general than the famous lower bound of Razborov and Andreev, because the gates of the circuit are allowed t