Editing Template:ProblemName

Jump to: navigation, search

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 68: Line 68:
 
| 67 = Difficult Instance for Max-Cut in the Streaming Model
 
| 67 = Difficult Instance for Max-Cut in the Streaming Model
 
| 68 = Approximating Rank in the Bounded-Degree Model
 
| 68 = Approximating Rank in the Bounded-Degree Model
| 69 = Correcting Independence of Distributions
 
| 70 = Open Problems in $L_p$-Testing
 
| 71 = Metric TSP Cost Approximation
 
| 72 = Communication Complexity of Approximating Set-Intersection Join
 
| 73 = Streaming Online Algorithms
 
| 74 = Succinct Representation for Functions on Graphs
 
| 75 = Data Structure Lower Bound in the Cell Probe Model
 
| 76 = External Information and Amortized Expected Communication
 
| 77 = Frontiers in Structural Communication Complexity
 
| 78 = Linear Sketching Over $F_2$
 
| 79 = Cryptogenography
 
| 80 = Merlin–Arthur Communication Complexity of Connectivity
 
| 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 Models
 
| 89 = AM vs. NP for Proofs of Proximity in Distribution Testing
 
| 90 = Dense Graph Property Testing “Tradeoffs”
 
| 91 = Cut-Sparsification of Hypergraphs
 
| 92 = Streaming Algorithms for Approximating the Number of $H$-Subgraphs
 
| 93 = Locally Private Heavy Hitters and Other Problems in Streaming
 
| 94 = Ads, Impressions, and Statistics
 
| 95 = Non-Adaptive Group Testing
 
| 96 = Identity Testing up to Coarsenings
 
| 97 = Local Computation Algorithm for MIS
 
| 98 = Estimating a Graph's Degree Distribution
 
| 99 = Vertex-Distribution-Free Graph Testing
 
| 100 = Effective Support Size Estimation in the Dual Model
 
| 101 = Vertex Connectivity in the LOCAL Model
 
| 102 = Making Edges Happy in the LOCAL Model
 
 
| !!! ADD THE PROBLEM NAME TO Template:ProblemName !!!
 
| !!! ADD THE PROBLEM NAME TO Template:ProblemName !!!
 
}}
 
}}

Please note that all contributions to Open Problems in Sublinear Algorithms may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see Open Problems in Sublinear Algorithms:Copyrights for details). Do not submit copyrighted work without permission!

To edit this page, please answer the question that appears below (more info):

Cancel Editing help (opens in new window)