Difference between revisions of "Main Page"
(→News) |
|||
| Line 5: | Line 5: | ||
== News == | == News == | ||
| + | '''May 20, 2013:''' Recently submitted updates: | ||
| + | * {{ProblemLink|50}} | ||
| + | |||
'''Mar 29, 2013:''' Recently submitted updates: | '''Mar 29, 2013:''' Recently submitted updates: | ||
* {{ProblemLink|31}} (resolved) | * {{ProblemLink|31}} (resolved) | ||
* {{ProblemLink|38}} | * {{ProblemLink|38}} | ||
* {{ProblemLink|40}} (resolved) | * {{ProblemLink|40}} (resolved) | ||
| − | |||
| − | |||
[[News|Old news…]] | [[News|Old news…]] | ||
Revision as of 00:51, 21 May 2013
About
The goal of this wiki is to collate a set of open problems in sub-linear algorithms and to track progress that is made on these problems. Important topics within sub-linear algorithms include data stream algorithms (sub-linear space), property testing (sub-linear time), and communication complexity (sub-linear communication) but this list isn't exhaustive. Indeed many of the early problems were posted at related workshops. We invite you to add further questions and update the wiki when progress is made on existing questions.
News
May 20, 2013: Recently submitted updates:
Mar 29, 2013: Recently submitted updates:
- Problem 31: Gap-Hamming Information Cost (resolved)
- Problem 38: Query Complexity of Local Partitioning Oracles
- Problem 40: Testing Monotonicity and the Lipschitz Property (resolved)
Content
- Ordered list of open problems
- Workshops where open problems were suggested
- Resources on sublinear algorithms
Random (Unsolved) Problem
Citing and Editing
Contact information
- Please send questions and comments to admin@sublinear.info.
- Who we are
