An exponential lower bound for one-time-only branching programs
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 562-566
- https://doi.org/10.1007/bfb0030340
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Bounds for width two branching programsPublished by Association for Computing Machinery (ACM) ,1983
- Multi-party protocolsPublished by Association for Computing Machinery (ACM) ,1983
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979