A very hard log space counting class
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- On counting and approximationPublished by Springer Nature ,2005
- On the complexity of rankingJournal of Computer and System Sciences, 1990
- Erratum: Two Applications of Indctive Counting for Complementation ProblemsSIAM Journal on Computing, 1989
- Two Applications of Inductive Counting for Complementation ProblemsSIAM Journal on Computing, 1989
- Characterizing the polynomial hierarchy by alternating auxiliary pushdown automataRAIRO - Theoretical Informatics and Applications, 1989
- Nondeterministic Space is Closed under ComplementationSIAM Journal on Computing, 1988
- The complexity of rankingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975