On the complexity of interactive proofs with bounded communication
- 1 August 1998
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 67 (4) , 205-214
- https://doi.org/10.1016/s0020-0190(98)00116-1
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986