@inproceedings{1de9ae84e32d4d1f908f10e644f7745c,
title = "A reverse minkowski theorem",
abstract = "We prove a conjecture due to Dadush, showing that if L ⊂ ℝn is a lattice such that det(L′) ≥ 1 for all sublattices L′ ⊆ L, then (Equation presented), where t:= 10(log n + 2). From this we also derive bounds on the number of short lattice vectors and on the covering radius.",
keywords = "Geometry of numbers, Lattices",
author = "Oded Regev and Noah Stephens-Davidowitz",
note = "Publisher Copyright: {\textcopyright} 2017 ACM.; 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 ; Conference date: 19-06-2017 Through 23-06-2017",
year = "2017",
month = jun,
day = "19",
doi = "10.1145/3055399.3055434",
language = "English (US)",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",
pages = "941--953",
editor = "Pierre McKenzie and Valerie King and Hamed Hatami",
booktitle = "STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing",
}