Relativized isomorphisms of NP-complete sets
- 1 June 1993
- journal article
- Published by Springer Nature in computational complexity
- Vol. 3 (2) , 186-205
- https://doi.org/10.1007/bf01200120
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- One-way functions and the nonisomorphism of NP-complete setsTheoretical Computer Science, 1991
- Collapsing degreesJournal of Computer and System Sciences, 1988
- Are there interactive protocols for co-NP languages?Information Processing Letters, 1988
- Diagonalizations over polynomial time computable setsTheoretical Computer Science, 1987
- Relativizing complexity classes with sparse oraclesJournal of the ACM, 1986
- The polynomial-time hierarchy and sparse oraclesJournal of the ACM, 1986
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- 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
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975