Some observations on the probabilistic algorithms and NP-hard problems
- 1 March 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 14 (1) , 39-43
- https://doi.org/10.1016/0020-0190(82)90139-9
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- 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
- Some connections between nonuniform and uniform complexity classesPublished by Association for Computing Machinery (ACM) ,1980
- Relativized questions involving probabilistic algorithmsPublished by Association for Computing Machinery (ACM) ,1978
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Reducibility, randomness, and intractibility (Abstract)Published by Association for Computing Machinery (ACM) ,1977
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975