Algorithms for the Densest Sub-Lattice Problem

DOI10.1137/1.9781611973105.79zbMath1421.68208OpenAlexW4247333762MaRDI QIDQ5741787

Daniele Micciancio, Daniel Dadush

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/19077d01e92a339afa8813bbc474791239b851cd

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 (3)

Improving convergence and practicality of slide-type reductions ⋮ Systematics of aligned axions ⋮ The convergence of slide-type reductions

This page was built for publication: Algorithms for the Densest Sub-Lattice Problem