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.

Saved in:

Bibliographic Details
Published in:	SIAM journal on discrete mathematics Vol. 25; no. 4; pp. 1562 - 1588
Main Authors:	Rubinfeld, Ronitt, Shapira, Asaf
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2011
Subjects:	Algorithms Applied mathematics Approximation Computer science Grants
ISSN:	0895-4801, 1095-7146
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!