Editing Open Problems:87
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 3: | Line 3: | ||
|who=Jayadev Acharya | |who=Jayadev Acharya | ||
}} | }} | ||
β | (This is a continuation of [[Open_Problems:66|Problem 66]] from the [[Workshops:Bertinoro_2014| | + | (This is a continuation of [[Open_Problems:66|Problem 66]] from the [[Workshops:Bertinoro_2014|Bertinoro]] workshop Bertinoro Workshop on Sublinear Algorithms.) |
For constant $\varepsilon>0$, it is known that the sample complexity of equivalence testing, in the conditional oracle model where the algorithm gets to condition the samples it receives on arbitrary subsets of the domain $[n]$, is $\Omega(\sqrt{\log\log n})$ and $O({\log\log n})$ {{cite|AcharyaCK-14,FalahatgarJOPS-15}}. | For constant $\varepsilon>0$, it is known that the sample complexity of equivalence testing, in the conditional oracle model where the algorithm gets to condition the samples it receives on arbitrary subsets of the domain $[n]$, is $\Omega(\sqrt{\log\log n})$ and $O({\log\log n})$ {{cite|AcharyaCK-14,FalahatgarJOPS-15}}. | ||
What is the exact dependence on the domain size of the sample complexity of equivalence testing in the conditional oracle model? | What is the exact dependence on the domain size of the sample complexity of equivalence testing in the conditional oracle model? |