基于加法组合学的最坏情况到平均情况的约简
Worst-Case to Average-Case Reductions via Additive Combinatorics
摘要:
我们提出了一个新的框架,设计最坏情况下的平均情况下减少。对于一个大类的问题,它提供了一个显式的转换的算法运行在时间$T$,只有正确的一小部分(subconstant)的输入到算法运行在时间$\widetilde{O}(T)$是正确的所有输入。使用我们的框架,我们得到这样有效的最坏情况下,平均情况下减少基本问题的各种计算模型,即矩阵乘法算法,流算法的在线矩阵向量乘法问题,静态数据结构的线性问题,以及多元多项式评估问题。我们的技术主要依赖于加法组合学。特别是,我们展示了一个局部校正引理,它依赖于一个新的概率版本的准多项式Bogolyubov-Ruzsa引理。
英文摘要:
We present a new framework for designing worst-case to average-case reductions. For a large class of problems, it provides an explicit transformation of algorithms running in time $T$ that are only correct on a small (subconstant) fraction of their inputs into algorithms running in time $\widetilde{O}(T)$ that are correct on all inputs. Using our framework, we obtain such efficient worst-case to average-case reductions for fundamental problems in a variety of computational models; namely, algorithms for matrix multiplication, streaming algorithms for the online matrix-vector multiplication problem, and static data structures for all linear problems as well as for the multivariate polynomial evaluation problem. Our techniques crucially rely on additive combinatorics. In particular, we show a local correction lemma that relies on a new probabilistic version of the quasi-polynomial Bogolyubov-Ruzsa lemma.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。