scientific article
From MaRDI portal
Publication:3770590
zbMath0633.10002MaRDI QIDQ3770590
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Software, source code, etc. for problems pertaining to number theory (11-04)
Related Items (6)
Algorithms to construct Minkowski reduced and Hermite reduced lattice bases ⋮ The hardness of approximate optima in lattices, codes, and systems of linear equations ⋮ A relation of primal--dual lattices and the complexity of shortest lattice vector problem ⋮ On the reduction of a random basis ⋮ A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor ⋮ Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
This page was built for publication:
