A decisive characterization of BPP
- 1 April 1986
- journal article
- Published by Elsevier in Information and Control
- Vol. 69 (1-3) , 125-135
- https://doi.org/10.1016/s0019-9958(86)80044-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- BPP and the polynomial hierarchyInformation Processing Letters, 1983
- Robustness of probabilistic computational complexity classes under definitional perturbationsInformation and Control, 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
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976