Immunity, Relativizations, and Nondeterminism
- 1 May 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (2) , 329-337
- https://doi.org/10.1137/0213023
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- Refining Nondeterminism in Relativizations of Complexity ClassesJournal of the ACM, 1983
- Relativizing Time, Space, and Time-SpaceSIAM Journal on Computing, 1982
- Bounded query machines: On NP and PSPACETheoretical Computer Science, 1981
- Completeness, Approximation and DensitySIAM Journal on Computing, 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
- Refining Nondeterminism in Relativized Polynomial-Time Bounded ComputationsSIAM Journal on Computing, 1980
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- On sets having only hard subsetsPublished by Springer Nature ,1974