Fooling Polytopes
Computational Complexity
2018-08-14 v1 Combinatorics
Abstract
We give a pseudorandom generator that fools -facet polytopes over with seed length . The previous best seed length had superlinear dependence on . An immediate consequence is a deterministic quasipolynomial time algorithm for approximating the number of solutions to any -integer program.
Keywords
Cite
@article{arxiv.1808.04035,
title = {Fooling Polytopes},
author = {Ryan O'Donnell and Rocco A. Servedio and Li-Yang Tan},
journal= {arXiv preprint arXiv:1808.04035},
year = {2018}
}