The complexity of the max word problem and the power of one-way interactive proof systems
Author:
- 1 September 1993
- journal article
- Published by Springer Nature in computational complexity
- Vol. 3 (3) , 292-305
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Proof verification and hardness of approximation problems1992
- Space-bounded probabilistic game automataJournal of the ACM, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Checking computations in polylogarithmic time1991
- The complexity of the max word problem1991
- The ring of k-regular sequencesLecture Notes in Computer Science, 1990
- Trading group theory for randomness1985
- The knowledge complexity of interactive proof-systems1985
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Word Problems Solvable in LogspaceJournal of the ACM, 1977