Pages that link to "Item:Q3580625"

The following pages link to High-Accuracy Semidefinite Programming Bounds for Kissing Numbers (Q3580625):

Displaying 22 items.

• Delsarte method in the problem on kissing numbers in high-dimensional spaces (Q483413) (← links)
• Rigidity of spherical codes (Q658415) (← links)
• Towards a proof of the 24-cell conjecture (Q722369) (← links)
• Low dimensional strongly perfect lattices. IV: The dual strongly perfect lattices of dimension 16 (Q2009162) (← links)
• Detecting a botnet in a network (Q2078962) (← links)
• Kissing numbers for balls with varying radii (Q2093111) (← links)
• Semidefinite programming bounds for the average kissing number (Q2143250) (← links)
• On an SDP relaxation for kissing number (Q2174884) (← links)
• Upper bounds for energies of spherical codes of given cardinality and separation (Q2200514) (← links)
• Contact graphs of ball packings (Q2200926) (← links)
• Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
• Invariant Semidefinite Programs (Q2802527) (← links)
• The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
• Latest Developments in the SDPA Family for Solving Large-Scale SDPs (Q2802543) (← links)
• CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications (Q2819222) (← links)
• On the Turing model complexity of interior point methods for semidefinite programming (Q2821802) (← links)
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry (Q4689862) (← links)
• Kissing number in non-Euclidean spaces of constant sectional curvature (Q4999491) (← links)
• Dual linear programming bounds for sphere packing via modular forms (Q5018380) (← links)
• Upper bounds for packings of spheres of several radii (Q5496785) (← links)
• New upper bounds for spherical codes and packings (Q6583556) (← links)
• Solving clustered low-rank semidefinite programs arising from polynomial optimization (Q6645951) (← links)