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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on discrete mathematics Jg. 25; H. 4; S. 1562 - 1588
Hauptverfasser: Rubinfeld, Ronitt, Shapira, Asaf
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2011
Schlagworte:
Algorithms
Applied mathematics
Approximation
Computer science
Grants
ISSN:0895-4801, 1095-7146
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0895-4801
1095-7146
DOI:10.1137/100791075