2000 character limit reached
Approximate in time -- now in any norm!
Published 5 Oct 2021 in cs.DS | (2110.02387v1)
Abstract: We show that a constant factor approximation of the shortest and closest lattice vector problem in any norm can be computed in time . This contrasts the corresponding time, (gap)-SETH based lower bounds for these problems that even apply for small constant approximation. For both problems, and , we reduce to the case of the Euclidean norm. A key technical ingredient in that reduction is a twist of Milman's construction of an -ellipsoid which approximates any symmetric convex body with an ellipsoid so that translates of a constant scaling of can cover and vice versa.
Paper Prompts
Sign up for free to create and run prompts on this paper.