On the power of interaction
- 1 March 1990
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 10 (1) , 3-25
- https://doi.org/10.1007/bf02122692
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Are there interactive protocols for co-NP languages?Information Processing Letters, 1988
- Hardness vs. randomnessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Interactive proof systems: Provers that never fail and random selectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Almost optimal lower bounds for small depth circuitsPublished by Association for Computing Machinery (ACM) ,1986
- Probabilistic quantifiers, adversaries, and complexity classes : An overviewPublished by Springer Nature ,1986
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- Separating the polynomial-time hierarchy by oraclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- Borel sets and circuit complexityPublished by Association for Computing Machinery (ACM) ,1983