Recommendations
- New upper bounds for kissing numbers from semidefinite programming
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Bounds for codes by semidefinite programming
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Semidefinite programming bounds for the average kissing number
Cites work
- A survey on the kissing numbers.
- Complementarity and nondegeneracy in semidefinite programming
- Das Problem der dreizehn Kugeln
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- scientific article; zbMATH DE number 2186177 (Why is no real title available?)
- scientific article; zbMATH DE number 108350 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 2115093 (Why is no real title available?)
- Improved Delsarte bounds for spherical codes in small dimensions
- New formulations for the Kissing Number Problem
- New upper bounds for kissing numbers from semidefinite programming
- Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
- Principal component analysis.
- The kissing number in four dimensions
- The thirteen spheres: a new proof
Cited in
(4)
This page was built for publication: On an SDP relaxation for kissing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174884)
