SLIDE REDUCTION, SUCCESSIVE MINIMA AND SEVERAL APPLICATIONS
From MaRDI portal
Publication:2872006
DOI10.1017/S0004972713000257zbMath1283.11098OpenAlexW2067670471MaRDI QIDQ2872006
Publication date: 14 January 2014
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972713000257
Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice points in specified regions (11P21)
Related Items (3)
Bounding basis reduction properties ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation
Cites Work
- Unnamed Item
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- New upper bounds on sphere packings. I
- Minkowski's Convex Body Theorem and Integer Programming
- Block Reduced Lattice Bases and Successive Minima
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: SLIDE REDUCTION, SUCCESSIVE MINIMA AND SEVERAL APPLICATIONS