On relativized exponential and probabilistic complexity classes
Author:
- Hans HellerHHHans Heller
- 31 December 1986
- journal article
- Published by Elsevier in Information and Control
- Vol. 71 (3) , 231-243
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Relativized polynomial hierarchies extending two levelsTheory of Computing Systems, 1984
- On Relativized Polynomial and Exponential ComputationsSIAM Journal on Computing, 1984
- BPP and the polynomial hierarchyInformation Processing Letters, 1983
- Sparse sets in NP-P1983
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- A note on sparse oracles for NPJournal of Computer and System Sciences, 1982
- Some observations on the probabilistic algorithms and NP-hard problemsInformation Processing Letters, 1982
- 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
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975