Name
Abstract | ||
|---|---|---|
We show that all known classical adversary lower bounds on randomized query complexity are equivalent for total functions, and are equal to the fractional block sensitivity fbs(f). That includes the Kolmogorov complexity bound of Laplante and Magniez and the earlier relational adversary bound of Aaronson. For partial functions, we show unbounded separations between fbs( f) and other adversary bounds, as well as between the relational and Kolmogorov complexity bounds. We also show that, for partial functions, fractional block sensitivity cannot give lower bounds larger than root n.bs(f), where n is the number of variables and bs(f) is the block sensitivity. Then we exhibit a partial function f that matches this upper bound, fbs(f) = Omega 2 (root n.bs(f)). |
Year | DOI | Venue |
|---|---|---|
2017 | 10.4230/LIPIcs.STACS.2018.8 | Leibniz International Proceedings in Informatics |
Keywords | DocType | Volume |
Randomized Query Complexity,Lower Bounds,Adversary Bounds,Fractional Block Sensitivity | Journal | 96 |
ISSN | Citations | PageRank |
1868-8969 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andris Ambainis | 1 | 2000 | 183.24 |
| Martins Kokainis | 2 | 16 | 4.17 |
| Krisjanis Prusis | 3 | 13 | 3.63 |
| Jevgenijs Vihrovs | 4 | 10 | 3.92 |