Difference between revisions of "Waiting"
| Line 16: | Line 16: | ||
* [[Waiting:Sample Stretching|Sample Stretching]] | * [[Waiting:Sample Stretching|Sample Stretching]] | ||
* [[Waiting:Equivalence testing lower bound via communication complexity|Equivalence testing lower bound via communication complexity]] | * [[Waiting:Equivalence testing lower bound via communication complexity|Equivalence testing lower bound via communication complexity]] | ||
| + | * [[Waiting:Equivalence testing with conditional samples|Equivalence testing with conditional samples]] | ||
| + | * [[Waiting:Separating PDF and CDF query models|Separating PDF and CDF query models]] | ||
| + | * [[Waiting:Proofs of Proximity, AM vs. MA|Proofs of Proximity, AM vs. MA]] | ||
| + | * [[Waiting:Natural settings for high-dimensional testing|Natural settings for high-dimensional testing]] | ||
| + | * [[Waiting:Phylogenetics|Waiting:Phylogenetics]] | ||
Revision as of 20:12, 20 October 2017
Submitting a new problem:
- Make sure your problem is not yet on the list.
- Edit this page to add
*[[Waiting:Your Problem Name|]]at the bottom. This will create a link to a page for your new problem. - Copy the content of Waiting:Sample Problem and use it as a starting point.
- Take your time editing the problem. See also the page with editing guidelines.
- Once you are satisfied with the quality of the writeup, send an email to admin@sublinear.info.
Problems in Preparation
- Sample Problem ← Please do not remove or edit!
- Rényi entropy estimation
- Beyond identity testing
- Instance-optimal Hellinger testing
- Efficient Pattern Maximum Likelihood Computation
- Sample Stretching
- Equivalence testing lower bound via communication complexity
- Equivalence testing with conditional samples
- Separating PDF and CDF query models
- Proofs of Proximity, AM vs. MA
- Natural settings for high-dimensional testing
- Waiting:Phylogenetics
