期刊
SIAM JOURNAL ON DISCRETE MATHEMATICS
卷 25, 期 4, 页码 1562-1588出版社
SIAM PUBLICATIONS
DOI: 10.1137/100791075
关键词
sublinear time algorithms; approximation algorithms; randomized algorithms; property testing
资金
- NSF [0732334, 0728645, DMS-0901355]
- Marie Curie Reintegration [PIRG03-GA-2008-231077]
- Israel Science Foundation [1147/09, 1675/09, 224/11]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
