The NP-completeness column: An ongoing guide
- 30 September 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (3) , 426-444
- https://doi.org/10.1016/0196-6774(88)90033-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The graph genus problem is NP-completeJournal of Algorithms, 1989
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- 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