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.

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on discrete mathematics Ročník 25; číslo 4; s. 1562 - 1588
Hlavní autoři: Rubinfeld, Ronitt, Shapira, Asaf
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia Society for Industrial and Applied Mathematics 01.01.2011
Témata:
Algorithms
Applied mathematics
Approximation
Computer science
Grants
ISSN:0895-4801, 1095-7146
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0895-4801
1095-7146
DOI:10.1137/100791075