Complexity and algorithms for computing Voronoi cells of lattices (Q3055167)

From MaRDI portal
Revision as of 10:12, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Complexity and algorithms for computing Voronoi cells of lattices
scientific article

    Statements

    title
    Complexity and algorithms for computing Voronoi cells of lattices (English)
    0 references
    author
    Achill Schürmann
    0 references
    Frank Vallentin
    0 references
    publication date
    7 November 2010
    0 references
    zbMATH Keywords
    Voronoi cell
    0 references
    Delone cell
    0 references
    covering radius
    0 references
    quantizer constant
    0 references
    lattice isomorphism problem
    0 references
    describes a project that uses
    PORTA
    0 references
    pd
    0 references
    Polyhedral
    0 references
    nauty
    0 references
    cdd
    0 references
    CARAT
    0 references
    cites work
    Q4935168
    0 references
    Q3622254
    0 references
    Q4518985
    0 references
    Q3974096
    0 references
    Q4219187
    0 references
    Extreme Forms
    0 references
    Q4271995
    0 references
    Q4273947
    0 references
    Q3135082
    0 references
    Convex Analysis
    0 references
    Q3818127
    0 references
    Q5692729
    0 references
    Q5638342
    0 references
    Lectures on Polytopes
    0 references

    Identifiers

    Mathematics Subject Classification ID
    11H31
    0 references
    11Y16
    0 references
    11E10
    0 references
    11H56
    0 references
    52B12
    0 references
    52B55
    0 references
    68Q25
    0 references
    68U05
    0 references
    zbMATH DE Number
    5813116
    0 references
    arXiv ID
    0804.0036
    0 references
    Wikidata QID
    Q110628961
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3055167&oldid=35198552"
    Powered by MediaWiki