Study of the Kepler's conjecture: the problem of the closest packing
From MaRDI portal
Publication:2430657
DOI10.1007/s00209-009-0644-2zbMath1243.52017OpenAlexW2057544595WikidataQ56267711 ScholiaQ56267711MaRDI QIDQ2430657
Publication date: 8 April 2011
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00209-009-0644-2
Numerical optimization and variational techniques (65K10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Related Items (4)
A FORMAL PROOF OF THE KEPLER CONJECTURE ⋮ Binary pattern tile set synthesis is NP-hard ⋮ Towards a proof of the 24-cell conjecture ⋮ Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism
Uses Software
Cites Work
This page was built for publication: Study of the Kepler's conjecture: the problem of the closest packing
