AI Chat AI Image Generator AI Video Text to Speech

Approximate CVP_p in time 2^0.802 n

05/11/2020

∙

by Friedrich Eisenbrand, et al.

∙

∙

We show that a constant factor approximation of the shortest and closest lattice vector problem w.r.t. any ℓ_p-norm can be computed in time 2^(0.802 +ϵ) n. This matches the currently fastest constant factor approximation algorithm for the shortest vector problem w.r.t. ℓ_2. To obtain our result, we combine the latter algorithm w.r.t. ℓ_2 with geometric insights related to coverings.

Friedrich Eisenbrand
10 publications
Moritz Venzin
6 publications

research

∙ 10/05/2021

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

We show that a constant factor approximation of the shortest and closest...

0 Thomas Rothvoss, et al. ∙

research

∙ 05/11/2020

Approximate CVP_∞ in time 2^0.802 n

We show that a constant factor approximation of the shortest and closest...

0 Friedrich Eisenbrand, et al. ∙

research

∙ 08/10/2019

Slide Reduction, Revisited---Filling the Gaps in SVP Approximation

We show how to generalize Gama and Nguyen's slide reduction algorithm [S...

0 Divesh Aggarwal, et al. ∙

research

∙ 06/11/2018

Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors

We show that unless ⊆ (2^(n)), there is no polynomial-time algorithm a...

0 Ishay Haviv, et al. ∙

research

∙ 06/10/2020

The nearest-colattice algorithm

In this work, we exhibit a hierarchy of polynomial time algorithms solvi...

0 Thomas Espitau, et al. ∙

research

∙ 07/19/2020

A 2^n/2-Time Algorithm for √(n)-SVP and √(n)-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP

We show a 2^n/2+o(n)-time algorithm that finds a (non-zero) vector in a ...

0 Divesh Aggarwal, et al. ∙

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...

0 Divesh Aggarwal, et al. ∙