Abstract.
We initiate a general study of the randomness complexity of property testing, aimed at reducing the randomness complexity of testers without (significantly) increasing their query complexity. One concrete motivation for this study is provided by the observation that the product of the randomness and query complexity of a tester determine the actual query complexity of implementing a version of this tester that utilizes a weak source of randomness (through a randomness-extractor). We present rather generic upper and lower bounds on the randomness complexity of property testing and study in depth the special case of testing bipartiteness in two standard property testing models.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received 12 September 2007
Rights and permissions
About this article
Cite this article
Goldreich, O., Sheffet, O. On The Randomness Complexity of Property Testing. comput. complex. 19, 99–133 (2010). https://doi.org/10.1007/s00037-009-0282-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-009-0282-4