Login / Signup
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments.
Itay Berman
Iftach Haitner
Eliad Tsfadia
Published in:
Electron. Colloquium Comput. Complex. (2019)
Keyphrases
</>
lower bound
worst case
upper bound
user interaction
user friendly
shared memory
parallel implementation
parallel computation
convergence theorem
data mining
machine learning
artificial intelligence
parallel processing
distributed memory
parallel execution
highly interactive