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

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