52 citations · 131 across the 29 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011
A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming
Daniel Dadush
The Integer Programming Problem (IP) for a polytope P \subseteq R^n is to find an integer point in P or decide that P is integer free. We give an algorithm for an approximate versi…
cs.CC2011★ 3 cited
Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms
Daniel Dadush, Santosh Vempala
We give a deterministic O(log n)^n algorithm for the {\em Shortest Vector Problem (SVP)} of a lattice under {\em any} norm, improving on the previous best deterministic bound of n^…