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.
| Original language | English |
|---|---|
| Pages (from-to) | 99-133 |
| Number of pages | 35 |
| Journal | Computational Complexity |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 2010 |
| Externally published | Yes |
Bibliographical note
Funding Information:This work is based on the M.Sc. thesis of Or Sheffet, which was completed at the WeizmannInstitute of Science under the supervision of Oded Goldre-ich. An extended abstract of this work appeared in the proceedings of RANDOM’07. The work was partially supported by the Israel Science Foundation (grant No. 460/05).
Funding
This work is based on the M.Sc. thesis of Or Sheffet, which was completed at the WeizmannInstitute of Science under the supervision of Oded Goldre-ich. An extended abstract of this work appeared in the proceedings of RANDOM’07. The work was partially supported by the Israel Science Foundation (grant No. 460/05).
| Funders | Funder number |
|---|---|
| Israel Science Foundation | 460/05 |
Keywords
- Property testing
- Randomness complexity
- Randomness extractors
- Sampling
- Weak sources of randomness