The NP-completeness column: An ongoing guide
- 30 September 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (3) , 433-447
- https://doi.org/10.1016/0196-6774(84)90022-1
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- BPP and the polynomial hierarchyInformation Processing Letters, 1983
- On Distinguishing Prime Numbers from Composite NumbersAnnals of Mathematics, 1983
- On a Primality Test of Solovay and StrassenSIAM Journal on Computing, 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
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- A note on Rabin's nearest-neighbor algorithmInformation Processing Letters, 1979
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975