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: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2012-05-04T22:25:23Z.
|
| Subjects: | |
| Online Access: | Get fulltext |
Similar Items
Some Sublinear Dynamic Integral Inequalities on Time Scales
by: Sun Yuangong
Published: (2010-01-01)
by: Sun Yuangong
Published: (2010-01-01)
Sublinear Time Motif Discovery from Multiple Sequences
by: Yunhui Fu, et al.
Published: (2013-10-01)
by: Yunhui Fu, et al.
Published: (2013-10-01)