scientific article; zbMATH DE number 6607548

DOI10.4086/toc.2016.v012a002zbMath1362.68291arXiv1212.6781OpenAlexW2572589677MaRDI QIDQ5741633

Daniel Dadush, Gábor Kun

Publication date: 29 July 2016

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.6781

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmsclosest vector problemhigh-dimensional geometrylattice algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06) Approximation algorithms (68W25)

Related Items (5)

Covering convex bodies and the closest vector problem ⋮ Voronoi Cells of Lattices with Respect to Arbitrary Norms ⋮ Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! ⋮ Approximate CVP_p in Time 2^{0.802 n} ⋮ Approximate CVP\(_p\) in time \(2^{0.802n}\)

Cites Work

• Unnamed Item
• Sampling methods for shortest vectors, closest vectors and successive minima
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• The Generalized Basis Reduction Algorithm
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
• A universal lattice code decoder for fading channels

This page was built for publication: