Inapproximability Results for Computational Problems on Lattices

DOI10.1007/978-3-642-02295-1_14zbMath1237.68101OpenAlexW122001617MaRDI QIDQ5188550

Subhash A. Khot

Publication date: 5 March 2010

Published in: The LLL Algorithm (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02295-1_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattices and convex bodies (number-theoretic aspects) (11H06) Approximation algorithms (68W25)

Related Items (5)

On the number of lattice points in a small sphere and a recursive lattice decoding algorithm ⋮ Unnamed Item ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Hermite’s Constant and Lattice Algorithms ⋮ Improvements in the analysis of Kannan's CVP algorithm

Uses Software

• CVPP

This page was built for publication: Inapproximability Results for Computational Problems on Lattices