Relativizing relativized computations
Authors:
- 12 November 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 68 (3) , 267-276
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Applications of matrix methods to the theory of lower bounds in computational complexityCombinatorica, 1990
- On relativized exponential and probabilistic complexity classesInformation and Control, 1986
- Relativized circuit complexityJournal of Computer and System Sciences, 1985
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- On relativization and the existence of complete sets1982
- Some connections between nonuniform and uniform complexity classes1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975