Space Complexity Vs. Query Complexity

@article{Lachish2006SpaceCV,
  title={Space Complexity Vs. Query Complexity},
  author={Oded Lachish and Ilan Newman and Asaf Shapira},
  journal={computational complexity},
  year={2006},
  volume={17},
  pages={70-93}
}
Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies the property or is “far” from satisfying it. The main focus of property testing is in identifying large families of properties that can be tested with a certain number of queries to the input. In this paper we study the relation between the space complexity of a language and its query complexity. Our main result is that for any… CONTINUE READING
BETA

Similar Papers

Loading similar papers…