Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere

DOI10.1137/1.9781611975994.53OpenAlexW3001041007MaRDI QIDQ5146824

No author found.

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.05515

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Algorithmic pure states for the negative spherical perceptron ⋮ Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual ⋮ Gaussian discrepancy: a probabilistic relaxation of vector balancing

This page was built for publication: Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere