Approximating Sumset Size
Approximating Sumset Size
复制标题
近似总集大小
DOI:
10.1137/1.9781611977073.94
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Servedio, Rocco A.
中科院分区:
文献类型:
--
作者:
De, Anindya;Nadimpali, Shivam;Servedio, Rocco A.
Given a subsetAof then-dimensional Boolean hypercube , thesumset A+Ais the set {a + a′ : a, a′∊A} where addition is in . Sumsets play an important role in additive combinatorics, where they feature in many central results of the field.The main result of this paper is a sublinear-time algorithm for the problem ofsumset size estimation. In more detail, our algorithm is given oracle access to (the indicator function of) an arbitrary and an accuracy parameter∊> 0, and with high probability it outputs a value 0 ≤v≤ 1 that is ±∊-close to Vol (A′+A′) for some perturbationA′⊆AofAsatisfying Vol (A \ A′) ≤∊. It is easy to see that without the relaxation of dealing withA′rather thanA, any algorithm for estimating Vol (A+A) to any nontrivial accuracy must make 2Ω(n)queries. In contrast, we give an algorithm whose query complexity depends only on∊and is completely independent of the ambient dimensionn.
登录
查看更多内容
DOI:
10.1007/978-3-642-22935-0_56
发表时间:
2011
期刊:
ArXiv
影响因子:
--
作者:
D. Ron;R. Rubinfeld;S. Safra;Omri Weinstein
通讯作者:
Omri Weinstein
DOI:
10.1007/s00039-005-0509-8
发表时间:
2003
期刊:
Geometric & Functional Analysis GAFA
影响因子:
--
作者:
B. Green
通讯作者:
B. Green
DOI:
--
发表时间:
2014
期刊:
Electron. Colloquium Comput. Complex.
影响因子:
--
作者:
Hamed Hatami;Pooya Hatami;Shachar Lovett
通讯作者:
Shachar Lovett
DOI:
--
发表时间:
2004
期刊:
影响因子:
--
作者:
E. Fischer
通讯作者:
E. Fischer
DOI:
10.1137/1.9781611973105.97
发表时间:
2012
期刊:
Electron. Colloquium Comput. Complex.
影响因子:
--
作者:
Arnab Bhattacharyya;E. Fischer;Shachar Lovett
通讯作者:
Shachar Lovett