Sublinear Time Algorithms
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can hope to achieve in this setting.
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Society for Industrial and Applied Mathematics
2012
|
| Online Access: | http://hdl.handle.net/1721.1/70521 https://orcid.org/0000-0002-4353-7639 |
Similar Items
Some Sublinear Dynamic Integral Inequalities on Time Scales
by: Sun Yuangong
Published: (2010-01-01)
by: Sun Yuangong
Published: (2010-01-01)