Randomness in interactive proofs
- 1 December 1993
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 3 (4), 319-354
- https://doi.org/10.1007/bf01275487
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- The Complexity of Approximating a Nonlinear ProgramPublished by World Scientific Pub Co Pte Ltd ,1993
- On the power of interactionCombinatorica, 1990
- Proving properties of interactive proofs by a generalized counting techniqueInformation and Computation, 1989
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988
- Deterministic simulation in LOGSPACEPublished by Association for Computing Machinery (ACM) ,1987
- Eigenvalues and expandersCombinatorica, 1986
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- 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
- Two theorems on random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978