Login / Signup
Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits
Shachar Lovett
Sasha Sodin
Published in:
CoRR (2007)
Keyphrases
</>
multi dimensional
stable set
lattice points
convex hull
euclidean space
uniformly distributed
euclidean distance
knapsack problem
randomly generated
block size
error correcting codes