Space-bounded hierarchies and probabilistic computations
- 30 April 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 28 (2) , 216-230
- https://doi.org/10.1016/0022-0000(84)90066-7
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Symmetric space-bounded computationPublished by Elsevier ,2002
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- AlternationJournal of the ACM, 1981
- Deterministic simulation of tape-bounded probabilistic turing machine transducersTheoretical Computer Science, 1980
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Log Space Recognition and Translation of Parenthesis LanguagesJournal of the ACM, 1977
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976