Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
APA
O’Donnell, R., Servedio, R. A., & Tan, L. Y. (2019). Fooling polytopes. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 614–625). Association for Computing Machinery. https://doi.org/10.1145/3313276.3316321
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free