Hermite’s Constant and Lattice Algorithms
DOI10.1007/978-3-642-02295-1_2zbMath1230.11155OpenAlexW196044395MaRDI QIDQ5188538
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_2
LLL algorithmlattice reductionHermite's inequalityHermite's constantMordell's inequalityblockwise algorithms
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice packing and covering (number-theoretic aspects) (11H31) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)
Related Items (24)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Higher-dimensional analogs of Hermite's constant
- An introduction to the geometry of numbers.
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Sieve algorithms for the shortest vector problem are practical
- Lattice problems in NP ∩ coNP
- The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Minkowski's Convex Body Theorem and Integer Programming
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- The densest lattice in twenty-four dimensions
- A sieve algorithm for the shortest lattice vector problem
- Inapproximability Results for Computational Problems on Lattices
- On the Complexity of Lattice Problems with Polynomial Approximation Factors
- Predicting Lattice Reduction
- Algorithmic Number Theory
- Rankin’s Constant and Blockwise Lattice Reduction
- On Positive Definite Quadratic Forms
- Observation on the Minimum of a Positive Quadratic Form in Eight Variables
- Algorithmic Number Theory
- Radon transforms and packings
This page was built for publication: Hermite’s Constant and Lattice Algorithms