A very hard log-space counting class
- 1 January 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 107 (1) , 3-30
- https://doi.org/10.1016/0304-3975(93)90252-o
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The complexity of ranking simple languagesTheory of Computing Systems, 1990
- On the complexity of rankingJournal of Computer and System Sciences, 1990
- The complexity of optimization problemsJournal of Computer and System Sciences, 1988
- The polynomial-time hierarchy and sparse oraclesJournal of the ACM, 1986
- Space-bounded hierarchies and probabilistic computationsJournal of Computer and System Sciences, 1984
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Some Results on Tape-Bounded Turing MachinesJournal of the ACM, 1969