Fooling Polytopes

Ryan O'Donnell,Rocco A. Servedio,Li-Yang Tan

JOURNAL OF THE ACM（2018）

引用 15|浏览95

暂无评分

摘要

We give a pseudorandom generator that fools m-facet polytopes over {0,1}^n with seed length polylog(m) ·log n. The previous best seed length had superlinear dependence on m. An immediate consequence is a deterministic quasipolynomial time algorithm for approximating the number of solutions to any {0,1}-integer program.

查看译文

关键词

Polytopes,pseudorandom generators,Littlewood-Offord,central limit theorems

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要