Finding well approximating lattices for a finite set of points (Q4683170): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1604.05989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding simultaneous Diophantine approximations with prescribed quality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate common divisors via lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fascinating quasicrystals / rank
 
Normal rank

Latest revision as of 15:57, 16 July 2024

scientific article; zbMATH DE number 6939518
Language Label Description Also known as
English
Finding well approximating lattices for a finite set of points
scientific article; zbMATH DE number 6939518

    Statements

    Finding well approximating lattices for a finite set of points (English)
    0 references
    0 references
    0 references
    0 references
    20 September 2018
    0 references
    Diophantine approximation
    0 references
    lattice
    0 references
    LLL algorithm
    0 references
    least squares algorithm
    0 references

    Identifiers