Does co-NP have short interactive proofs?
- 1 May 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (2), 127-132
- https://doi.org/10.1016/0020-0190(87)90232-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A low and a high hierarchy within NPJournal of Computer and System Sciences, 1983
- 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
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952