3 citations · 4 across the 4 of their papers we have counts for
1 paper · 1 filter
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^…