Arthur-Merlin Streaming Complexity

@article{Gur2013ArthurMerlinSC,
  title={Arthur-Merlin Streaming Complexity},
  author={Tom Gur and Ran Raz},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2013},
  volume={20},
  pages={20}
}
We study the power of Arthur-Merlin probabilistic proof systems in the data stream model. We show a canonical AM streaming algorithm for a wide class of data stream problems. The algorithm offers a tradeoff between the length of the proof and the space complexity that is needed to verify it. As an application, we give an AM streaming algorithm for the Distinct Elements problem. Given a data stream of length m over alphabet of size n, the algorithm uses Õ(s) space and a proof of size Õ(w), for… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS