On oblivious branching programs of linear length
- 1 October 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 94 (2), 232-249
- https://doi.org/10.1016/0890-5401(91)90039-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Lower bounds for depth-restricted branching programsInformation and Computation, 1991
- On the complexity of branching programs and decision trees for clique functionsJournal of the ACM, 1988
- A Time-Space Tradeoff for Sorting on a General Sequential Model of ComputationSIAM Journal on Computing, 1982
- Word Problems Solvable in LogspaceJournal of the ACM, 1977
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Das Identitätsproblem für Gruppen mit einer definierenden RelationMathematische Annalen, 1932
- Über diskontinuierliche Gruppen mit einer definierenden Relation. (Der Freiheitssatz).Journal für die reine und angewandte Mathematik (Crelles Journal), 1930