A note on read-$k$ times branching programs
Open Access
- 1 January 1995
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 29 (1), 75-83
- https://doi.org/10.1051/ita/1995290100751
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On lower bounds for read-k-times branching programscomputational complexity, 1993
- Separating the eraser Turing machine classes Le, NLe, co-NLe and PeTheoretical Computer Science, 1991
- Lower bounds for deterministic and nondeterministic branching programsLecture Notes in Computer Science, 1991
- The effect of null-chains on the complexity of contact schemesLecture Notes in Computer Science, 1989
- Nondeterministic Space is Closed under ComplementationSIAM Journal on Computing, 1988
- An exponential lower bound for one-time-only branching programsLecture Notes in Computer Science, 1984
- On a class of error correcting binary group codesInformation and Control, 1960