Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere
Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA)Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the SphereChris Jones and Matt McPartlonChris Jones and Matt McPartlonpp.874 - 891Chapter DOI:https://doi.org/10.1137/1.9781611975994.53PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract Inspired by the boolean discrepancy problem, we …