@inproceedings{f45d9020ea2f44cbad5dd3993390d089,
title = "On the randomness complexity of property testing",
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.",
author = "Oded Goldreich and Or Sheffet",
year = "2007",
doi = "10.1007/978-3-540-74208-1_37",
language = "אנגלית",
isbn = "9783540742074",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "509--524",
booktitle = "Approximation, Randomization, and Combinatorial Optimization",
address = "גרמניה",
note = "10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and 11th International Workshop on Randomization and Computation, RANDOM 2007 ; Conference date: 20-08-2007 Through 22-08-2007",
}