Get the latest tech news
Sublinear Time Algorithms
daunting goal since it allows one to read only a miniscule fraction of the input. There are problems for which deterministic exact sublinear time algorithms are known.
We have long considered showing the existence of a linear time algorithm for a problem to be the gold standard of achievement. Several useful techniques, including the use of the Szemeredi Regularity lemma and low rank approximations of matrices, have emerged for designing sublinear algorithms. The following contains some pointers to a few surveys on sublinear algorithms and property testing, as well as slides from a short introductory talk.
Or read this on Hacker News