Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR11-013 | 3rd February 2011 00:00

Sublinear Time Algorithms

RSS-Feed




TR11-013
Authors: Ronitt Rubinfeld, Asaf Shapira
Publication: 3rd February 2011 01:35
Downloads: 1377
Keywords: 


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.



ISSN 1433-8092 | Imprint