Sublinear Time Algorithms

Author(s)
Rubinfeld, Ronitt; Shapira, Asaf
Thumbnail
DownloadRubinfeld-2011-Sublinear time algor.pdf (335.9Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
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.
Date issued
2011-11
URI
http://hdl.handle.net/1721.1/70521
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics
Citation
Rubinfeld, Ronitt, and Asaf Shapira. “Sublinear Time Algorithms.” SIAM Journal on Discrete Mathematics 25.4 (2011): 1562. Web. 4 May 2012. © 2011 Society for Industrial and Applied Mathematics
Version: Final published version
ISSN
0895-4801
1095-7146
Collections