Robustness of probabilistic computational complexity classes under definitional perturbations
- 30 September 1982
- journal article
- Published by Elsevier in Information and Control
- Vol. 54 (3) , 143-154
- https://doi.org/10.1016/s0019-9958(82)80019-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 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
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977