Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR18-145 | 13th August 2018 05:37

Fooling Polytopes

RSS-Feed




TR18-145
Authors: Ryan O'Donnell, Rocco Servedio, Li-Yang Tan
Publication: 19th August 2018 18:24
Downloads: 236
Keywords: 


Abstract:

We give a pseudorandom generator that fools $m$-facet polytopes over $\{0,1\}^n$ with seed length $\mathrm{polylog}(m) \cdot \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.



ISSN 1433-8092 | Imprint