A basic lower bound for property testing
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909172311785472 |
|---|---|
| author | Fischer, Eldar |
| author_facet | Fischer, Eldar |
| contents | An $ε$-test for any non-trivial property (one for which there are both satisfying inputs and inputs of large distance from the property) should use a number of queries that is at least inversely proportional in $ε$. However, to the best of our knowledge there is no reference proof for this intuition. Such a proof is provided here. It is written so as to not require any prior knowledge of the related literature, and in particular does not use Yao's method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_04999 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A basic lower bound for property testing Fischer, Eldar Data Structures and Algorithms An $ε$-test for any non-trivial property (one for which there are both satisfying inputs and inputs of large distance from the property) should use a number of queries that is at least inversely proportional in $ε$. However, to the best of our knowledge there is no reference proof for this intuition. Such a proof is provided here. It is written so as to not require any prior knowledge of the related literature, and in particular does not use Yao's method. |
| title | A basic lower bound for property testing |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2403.04999 |