Difference between revisions of "Template:ProblemName"

From Open Problems in Sublinear Algorithms
Jump to: navigation, search
m
(Adding new problem names)
Line 80: Line 80:
 
| 79 = Cryptogenography
 
| 79 = Cryptogenography
 
| 80 = Merlin–Arthur Communication Complexity of Connectivity
 
| 80 = Merlin–Arthur Communication Complexity of Connectivity
| 81 = Read Twice Branching Programs
+
| 81 = Rényi Entropy Estimation
 +
| 82 = Beyond Identity Testing
 +
| 83 = Instance-Specific Hellinger Testing
 +
| 84 = Efficient Profile Maximum Likelihood Computation
 +
| 85 = Sample Stretching
 +
| 86 = Equivalence Testing Lower Bound via Communication Complexity
 +
| 87 = Equivalence Testing with Conditional Samples
 +
| 88 = Separating PDF and CDF Query <odels
 +
| 89 = Proofs of Proximity, AM vs. NP
 
| !!! ADD THE PROBLEM NAME TO Template:ProblemName !!!
 
| !!! ADD THE PROBLEM NAME TO Template:ProblemName !!!
 
}}
 
}}

Revision as of 05:51, 8 November 2017

!!! ADD THE PROBLEM NAME TO Template:ProblemName !!!