Two characterizations of the logarithmic alternation hierarchy
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 518-526
- https://doi.org/10.1007/bfb0016278
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machinesLecture Notes in Computer Science, 1986
- Space-bounded hierarchies and probabilistic computationsJournal of Computer and System Sciences, 1984
- AlternationJournal of the ACM, 1981
- Log Space Recognition and Translation of Parenthesis LanguagesJournal of the ACM, 1977
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972