Approximating the densest sublattice from Rankin's inequality
type: Item
instance of: scholarly article
zbMATH Open document ID: 1296.11087
DOI: 10.1112/S1461157014000333
author: Jianwei Li
author: Phong Q. Nguyen
published in: LMS Journal of Computation and Mathematics
publication date: 2014-09-05T00:00:00Z
Mathematics Subject Classification ID: 11H06
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 6340489
zbMATH Keywords: sublattice
zbMATH Keywords: Gama-Nguyen algorithm
zbMATH Keywords: Rankin's inequality
MaRDI profile type: Publication
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
cites work: New bounds in some transference theorems in the geometry of numbers
cites work: On Positive Definite Quadratic Forms
cites work: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
cites work: An LLL Algorithm with Quadratic Complexity
cites work: Observation on the Minimum of a Positive Quadratic Form in Eight Variables
cites work: Factoring polynomials with rational coefficients
cites work: A hierarchy of polynomial time lattice basis reduction algorithms
full work available at URL: s1461157014000333
OpenAlex ID: W2068332087
title: Approximating the densest sublattice from Rankin's inequality
description: scientific article; zbMATH DE number 6340489