Approximate CVP in time 2^0.802 n – now in any norm!

10/05/2021
by   Thomas Rothvoss, et al.
0

We show that a constant factor approximation of the shortest and closest lattice vector problem in any norm can be computed in time 2^0.802 n. This contrasts the corresponding 2^n time, (gap)-SETH based lower bounds for these problems that even apply for small constant approximation. For both problems, SVP and CVP, 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 M-ellipsoid which approximates any symmetric convex body K with an ellipsoid ℰ so that 2^ε n translates of a constant scaling of ℰ can cover K and vice versa.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2020

Approximate CVP_p in time 2^0.802 n

We show that a constant factor approximation of the shortest and closest...
research
05/24/2020

A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices

Blömer and Seifert showed that 𝖲𝖨𝖵𝖯_2 is NP-hard to approximate by givin...
research
03/26/2018

Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH

The k-Even Set problem is a parameterized variant of the Minimum Distanc...
research
05/11/2020

Approximate CVP_∞ in time 2^0.802 n

We show that a constant factor approximation of the shortest and closest...
research
10/29/2022

The Vector Balancing Constant for Zonotopes

The vector balancing constant vb(K,Q) of two symmetric convex bodies K,Q...
research
04/23/2020

Diophantine problems related to the Omega constant

Some diophantine problems are stated for the Omega constant and, more ge...
research
10/04/2019

Efficient Symmetric Norm Regression via Linear Sketching

We provide efficient algorithms for overconstrained linear regression pr...

Please sign up or login with your details

Forgot password? Click here to reset