BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Fooling polytopes Servedio, Rocco


We give an explicit pseudorandom generator with seed length poly(log m, 1/\delta) * log n that \delta-fools the class of all m-facet polytopes over {0,1}^n. The previous best seed length had linear dependence on m. As a corollary, we obtain a deterministic quasipolynomial time algorithm for approximately counting the number of feasible solutions of general {0,1}-integer programs. Joint work with Ryan O'Donnell (CMU) and Li-Yang Tan (Stanford).

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International