On oblivious branching programs of linear length
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 287-296
- https://doi.org/10.1007/3-540-51498-8_28
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On the complexity of branching programs and decision trees for clique functionsJournal of the ACM, 1988
- Lower bounds on the complexity of real-time branching programsRAIRO - Theoretical Informatics and Applications, 1988
- Meanders, Ramsey theory and lower bounds for branching programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Two lower bounds for branching programsPublished by Association for Computing Machinery (ACM) ,1986
- A complexity theory based on Boolean algebraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Word Problems Solvable in LogspaceJournal of the ACM, 1977