article

Does co-NP have short interactive proofs?

Authors:

R. B. Boppana,

J. Hastad,

S. ZachosAuthors Info & Claims

Information Processing Letters, Volume 25, Issue 2

Pages 127 - 132

https://doi.org/10.1016/0020-0190(87)90232-8

Published: 06 May 1987 Publication History

Abstract

No abstract available.

Cited By

View all

D’Alconzo G(2024)Monomial isomorphism for tensors and applications to code equivalence problemsDesigns, Codes and Cryptography10.1007/s10623-024-01375-092:7(1961-1982)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1007/s10623-024-01375-0
Ilango RLi JWilliams RSaha BServedio R(2023)Indistinguishability Obfuscation, Range Avoidance, and Bounded ArithmeticProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585187(1076-1089)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585187
Aaronson SIngram DKretschmer W(2022)The acrobatics of BQPProceedings of the 37th Computational Complexity Conference10.4230/LIPIcs.CCC.2022.20(1-17)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2022.20
Show More Cited By

Index Terms

Does co-NP have short interactive proofs?
1. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
    2. Complexity theory and logic

Recommendations

Combinatorial PCPs with Short Proofs

The Probabilistically Checkable Proof (PCP) theorem (Arora and Safra in J ACM 45(1):70---122, 1998; Arora et al. in J ACM 45(3):501---555, 1998) asserts the existence of proofs that can be verified by reading a very small part of the proof. Since the ...
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy

If every language in coNP has a constant-round interactive proof system, then the polynomial-time hierarchy collapses [R.B. Boppana, J. Håstad, S. Zachos, Does co-NP have short interactive proofs? Information Processing Letters 25 (2) (1987) 127-132]. ...
Non-Interactive Proofs of Proximity
ITCS '15: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science

We initiate a study of non-interactive proofs of proximity. These proof-systems consist of a verifier that wishes to ascertain the validity of a given statement, using a short (sublinear length) explicitly given proof, and a sublinear number of queries ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 25, Issue 2

6 May 1987

63 pages

ISSN:0020-0190

Editor:
A. V. Aho
AT&T Bell Laboratories, Murray Hill, NJ

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 06 May 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

116
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

D’Alconzo G(2024)Monomial isomorphism for tensors and applications to code equivalence problemsDesigns, Codes and Cryptography10.1007/s10623-024-01375-092:7(1961-1982)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1007/s10623-024-01375-0
Ilango RLi JWilliams RSaha BServedio R(2023)Indistinguishability Obfuscation, Range Avoidance, and Bounded ArithmeticProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585187(1076-1089)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585187
Aaronson SIngram DKretschmer W(2022)The acrobatics of BQPProceedings of the 37th Computational Complexity Conference10.4230/LIPIcs.CCC.2022.20(1-17)Online publication date: 20-Jul-2022
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2022.20
Datta SLimaye NNimbhorkar PThierauf TWagner F(2022)Planar Graph Isomorphism Is in Log-SpaceACM Transactions on Computation Theory10.1145/354368614:2(1-33)Online publication date: 14-Sep-2022
https://dl.acm.org/doi/10.1145/3543686
Chiesa AForbes MGur TSpooner N(2022)Spatial Isolation Implies Zero Knowledge Even in a Quantum WorldJournal of the ACM10.1145/351110069:2(1-44)Online publication date: 31-Jan-2022
https://dl.acm.org/doi/10.1145/3511100
Bitansky NChiesa AIshai YOstrovsky RPaneth O(2022)Succinct Non-Interactive Arguments via Linear Interactive ProofsJournal of Cryptology10.1007/s00145-022-09424-435:3Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1007/s00145-022-09424-4
Vereshchagin N(2022)How Much Randomness is Needed to Convert MA Protocols to AM Protocols?Computer Science – Theory and Applications10.1007/978-3-031-09574-0_21(338-349)Online publication date: 29-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-09574-0_21
Fortnow L(2021)Fifty years of P vs. NP and the possibility of the impossibleCommunications of the ACM10.1145/346035165:1(76-85)Online publication date: 17-Dec-2021
https://dl.acm.org/doi/10.1145/3460351
Das BSharma S(2021)Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group ClassesTheory of Computing Systems10.1007/s00224-020-10010-z65:3(497-514)Online publication date: 1-Apr-2021
https://dl.acm.org/doi/10.1007/s00224-020-10010-z
Satybaldy ANowostawski MGai KRaymond Choo KLiu J(2020)Review of Techniques for Privacy-Preserving Blockchain SystemsProceedings of the 2nd ACM International Symposium on Blockchain and Secure Critical Infrastructure10.1145/3384943.3409416(1-9)Online publication date: 6-Oct-2020
https://dl.acm.org/doi/10.1145/3384943.3409416
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Combinatorial PCPs with Short Proofs

Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy

Non-Interactive Proofs of Proximity

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations