Relativizations of Unambiguous and Random Polynomial Time Classes
- 1 May 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (2), 511-519
- https://doi.org/10.1137/0215035
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- Immunity, Relativizations, and NondeterminismSIAM Journal on Computing, 1984
- The complexity of promise problems with applications to public-key cryptographyInformation and Control, 1984
- On relativization and the existence of complete setsPublished by Springer Nature ,1982
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975