Does co-NP Have Short Interactive Proofs?

@article{Boppana1987DoesCH,
  title={Does co-NP Have Short Interactive Proofs?},
  author={Ravi B. Boppana and Johan H{\aa}stad and Stathis Zachos},
  journal={Inf. Process. Lett.},
  year={1987},
  volume={25},
  pages={127-132}
}
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 209 extracted citations

Structural Complexity II

View 7 Excerpts
Highly Influenced

Why Philosophers Should Care About Computational Complexity

Electronic Colloquium on Computational Complexity • 2011
View 20 Excerpts
Highly Influenced

K. Narayan Kumar (Eds.)

View 10 Excerpts
Highly Influenced

Proof-Carrying Data

View 7 Excerpts
Highly Influenced

Parallel repetition of zero-knowledge proofs and the possibility of basing cryptography on NP-hardness

21st Annual IEEE Conference on Computational Complexity (CCC'06) • 2006
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…