Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
- 1 February 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (1) , 46-53
- https://doi.org/10.1137/0209003
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965