A hardness of approximation result in metric geometry

Author(s)
Brady, Zarathustra; Guth, Larry; Manin, Fedor
Thumbnail
Download29_2020_585_ReferencePDF.pdf (257.4Kb)
Open Access Policy
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
Abstract We show that it is $${\mathsf {NP}}$$ NP -hard to approximate the hyperspherical radius of a triangulated manifold up to an almost-polynomial factor.
Date issued
2020-07-20
URI
https://hdl.handle.net/1721.1/131412
Department
Massachusetts Institute of Technology. Department of Mathematics
Publisher
Springer International Publishing
Citation
Selecta Mathematica. 2020 Jul 20;26(4):54
Version: Author's final manuscript
Collections