Arthur-Merlin Streaming Complexity

DOI10.1007/978-3-642-39206-1_45zbMath1327.68100OpenAlexW2125608006MaRDI QIDQ5326589

Ran Raz, Tom Gur

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_45

zbMATH Keywords

communication complexitydata streamsprobabilistic proof systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Unnamed Item ⋮ Non-interactive proofs of proximity ⋮ Verifiable Stream Computation and Arthur--Merlin Communication

This page was built for publication: Arthur-Merlin Streaming Complexity