Interactive proof systems and alternating time-space complexity
- 13 November 2005
- book chapter
- Published by Springer Nature
- Vol. 113 (1) , 263-274
- https://doi.org/10.1007/bfb0020804
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Are there interactive protocols for co-NP languages?Information Processing Letters, 1988
- AlternationJournal of the ACM, 1981
- On alternation IIActa Informatica, 1980
- On the Tape Complexity of Deterministic Context-Free LanguagesJournal of the ACM, 1978
- Time and tape bounded auxiliary pushdown automataPublished by Springer Nature ,1977
- A hierarchy for nondeterministic time complexityJournal of Computer and System Sciences, 1973
- A Note Concerning Nondeterministic Tape ComplexitiesJournal of the ACM, 1972
- Schnelle Multiplikation großer ZahlenComputing, 1971