Approximating the densest sublattice from Rankin’s inequality (Q2878829): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds in some transference theorems in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Positive Definite Quadratic Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LLL Algorithm with Quadratic Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observation on the Minimum of a Positive Quadratic Form in Eight Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1112/s1461157014000333 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068332087 / rank
 
Normal rank

Latest revision as of 09:13, 30 July 2024

scientific article
Language Label Description Also known as
English
Approximating the densest sublattice from Rankin’s inequality
scientific article

    Statements

    Identifiers