A hardness of approximation result in metric geometry
Name
29_2020_585_ReferencePDF.pdf
Size
257.45 KB
Format
Adobe PDF
Checksum (MD5)
f8b5595def68091c96e3285c3c668e9a
Author(s)
Brady, Zarathustra
Guth, Larry
Manin, Fedor
Date Issued
July 20, 2020
Publisher
Springer International Publishing
Citation
Selecta Mathematica. 2020 Jul 20;26(4):54
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00029-020-00585-3
