Complexity and algorithms for computing Voronoi cells of lattices (Q3055167): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: cdd / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CARAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0804.0036 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q110628961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of lattices for quantization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density of a lattice covering for<i>n</i>= 11 and<i>n</i>= 14 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattice covering density for \(n = 13\) and \(n = 15\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfect lattices \(\Gamma ({\mathfrak A}^ n)\), and the covering density of \(\Gamma ({\mathfrak A}^ 9)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Potential Theory on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3622254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization and small polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay polytopes of cut lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating CVP to within almost-polynomial factors is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of eight-dimensional perfect forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Vertex Enumeration Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry and Topology for Mesh Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices Which Are Good for (Almost) Everything / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frobenius problem and the covering radius of a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4271995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the covering radius problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lattice Isomorphism Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all vertices of a polyhedron is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration on a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Enumeration Problems in Geometry and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi Domains and Dual Cells in the Generalized Kaleidoscope with Applications to Root and Weight Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crystallographic Algorithms and Tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing isometries of lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational approaches to lattice packing and covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Voronoi cell of a lattice: the diamond-cutting algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105421475 / rank
 
Normal rank

Latest revision as of 09:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Complexity and algorithms for computing Voronoi cells of lattices
scientific article

    Statements

    Complexity and algorithms for computing Voronoi cells of lattices (English)
    0 references
    0 references
    0 references
    7 November 2010
    0 references
    Voronoi cell
    0 references
    Delone cell
    0 references
    covering radius
    0 references
    quantizer constant
    0 references
    lattice isomorphism problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references