IP = PSPACE-Reference-Cited by-同舟云学术

IP = PSPACE

Published:1992-10 Issue:4 Volume:39 Page:869-877
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Shamir Adi¹

Affiliation:

1. The Weizmann Institute of Science, Rehovot, Israel

Abstract

In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated with polynomial space.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/146585.146609

Reference12 articles.

1. Does co-NP have short interactive proofs?

2. ~FORTNOW L. AND StPSER M. Interactive proof systems with a log space verifier. Unpub- ~lished manuscript 1988. ~FORTNOW L. AND StPSER M. Interactive proof systems with a log space verifier. Unpub- ~lished manuscript 1988.

3. ~GAREY M. AND JOHNSON D. Computers and intractability A guide to the theory of ~NP-completeness. W. H. Freeman San Francisco Calif. 1979. ~GAREY M. AND JOHNSON D. Computers and intractability A guide to the theory of ~NP-completeness. W. H. Freeman San Francisco Calif. 1979.

Cited by 380 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Batch Proofs Are Statistically Hiding;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Nondeterministic Quasi-Polynomial Time is Average-Case Hard for \(\textsf{ACC}\) Circuits;SIAM Journal on Computing;2024-02-23

3. Experimental implementation of an efficient test of quantumness;Physical Review A;2024-01-09

4. Strong Batching for Non-interactive Statistical Zero-Knowledge;Lecture Notes in Computer Science;2024

5. Interactive Proof;Encyclopedia of Cryptography, Security and Privacy;2024