Sublinear Time Algorithms
Name
Rubinfeld-2011-Sublinear time algor.pdf
Size
335.9 KB
Format
Adobe PDF
Checksum (MD5)
0723b34a0ecf8d4579abf363bf671657
Author(s)
Rubinfeld, Ronitt
Shapira, Asaf
Date Issued
November 2011
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
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/100791075
