Oracles for Deterministic Versus Alternating Classes
- 1 August 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (4) , 613-627
- https://doi.org/10.1137/0216042
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- The existence and density of generalized complexity coresJournal of the ACM, 1987
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Relativized circuit complexityJournal of Computer and System Sciences, 1985
- Space-bounded hierarchies and probabilistic computationsJournal of Computer and System Sciences, 1984
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- On relativization and the existence of complete setsPublished by Springer Nature ,1982
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- AlternationJournal of the ACM, 1981
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Translational lemmas, polynomial time, and (log n)j-spaceTheoretical Computer Science, 1976