Efficient algorithms for discrete lattice calculations (Q2390437): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Closest point search in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Essential and Non-Essential Descriptions of Multilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry and symmetry of multilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5289009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive finite element approach to atomic-scale mechanics. -- The quasicontinuum method / rank
 
Normal rank

Latest revision as of 20:09, 1 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for discrete lattice calculations
scientific article

    Statements

    Efficient algorithms for discrete lattice calculations (English)
    0 references
    0 references
    0 references
    0 references
    22 July 2009
    0 references
    0 references
    lattice algorithms
    0 references
    lattice reduction
    0 references
    nearest neighbor
    0 references
    cluster computation
    0 references
    quasicontinuum
    0 references
    0 references