Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings

Daniel Dadush, Chris Peikert, Santosh Vempala. Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings. In Rafail Ostrovsky, editor, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011. pages 580-589, IEEE, 2011. [doi]

Abstract

Abstract is missing.