Best-order streaming model

We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a stream). Moreover, the proof itself is nothing but a reordering of the input data. This model has a close relationship to many models of computation in other areas such as data streams, communication complexity, and proof checking and could be used in applications such as cloud computing. In this paper we focus on graph problems where the input is a sequence of edges. We show that checking if a graph has a perfect matching is impossible to do deterministically using small space. To contrast this, we show that randomized verifiers are powerful enough to check whether a graph has a perfect matching or is connected.

[1]  Joan Feigenbaum,et al.  On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..

[2]  Feifei Li,et al.  Randomized Synopses for Query Assurance on Data Streams , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[3]  Joan Feigenbaum,et al.  Graph distances in the streaming model: the value of space , 2005, SODA '05.

[4]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.

[5]  Jaikumar Radhakrishnan,et al.  Finding duplicates in a data stream , 2009, SODA.

[6]  Graham Cormode,et al.  Annotations in Data Streams , 2009, ICALP.

[7]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[8]  Mahesh Viswanathan,et al.  Testing and spot-checking of data streams (extended abstract) , 2000, ACM-SIAM Symposium on Discrete Algorithms.

[9]  Thomas Lengauer.  VLSI Theory , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[10]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[11]  Avi Wigderson,et al.  The Randomized Communication Complexity of Set Disjointness , 2007, Theory Comput..

[12]  Yael Tauman Kalai,et al.  Delegating computation: interactive proofs for muggles , 2008, STOC.

[13]  Sudipto Guha,et al.  Approximate quantiles and the order of the stream , 2006, PODS.

[14]  Camil Demetrescu,et al.  Trading off space for passes in graph streaming problems , 2006, SODA 2006.

[15]  Martin Aigner,et al.  Proofs from THE BOOK , 1998 .

[16]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[17]  Wolfgang Maass,et al.  On the communication complexity of graph properties , 1988, STOC '88.

[18]  Richard J. Lipton,et al.  Efficient Checking of Computations , 1990, STACS.

[19]  Mahesh Viswanathan,et al.  Testing and Spot-Checking of Data Streams , 2000, SODA '00.

[20]  Matthias Ruhl,et al.  Efficient algorithms for new computational models , 2003 .

[21]  Graham Cormode,et al.  Robust lower bounds for communication and stream computation , 2008, Theory Comput..

[22]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[23]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[24]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[25]  Tak Wah Lam,et al.  Results on communication complexity classes , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[27]  T. S. Jayram,et al.  Tight lower bounds for selection in randomly ordered streams , 2008, SODA '08.

[28]  Yin Yang,et al.  CADS: Continuous Authentication on Data Streams , 2007, VLDB.

[29]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[30]  Georg Schnitger,et al.  The communication complexity of several problems in matrix computation , 1991, J. Complex..

[31]  Mayur Datar,et al.  On the streaming model augmented with a sorting primitive , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[32]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[33]  Oded Goldreich.  Property testing in massive graphs , 2002 .

[34]  Sudipto Guha,et al.  Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming , 2007, ICALP.

[35]  Feifei Li,et al.  Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams , 2007, VLDB.

[36]  Noga Alon,et al.  The Space Complexity of Approximating the Frequency Moments , 1999 .