On the relativized power of additional accepting paths
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Relativized counting classes: Relations among thresholds, parity, and modsJournal of Computer and System Sciences, 1991
- Complexity Measures for Public-Key CryptosystemsSIAM Journal on Computing, 1988
- Generic oracles and oracle classesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Relativizations of Unambiguous and Random Polynomial Time ClassesSIAM Journal on Computing, 1986
- The complexity of sparse sets in PPublished by Springer Nature ,1986
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- 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
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Translational methods and computational complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965