A hardness of approximation result in metric geometry
Differential Geometry
2020-08-24 v2 Computational Geometry
Metric Geometry
Abstract
We show that it is -hard to approximate the hyperspherical radius of a triangulated manifold up to an almost-polynomial factor.
Cite
@article{arxiv.1908.02824,
title = {A hardness of approximation result in metric geometry},
author = {Zarathustra Brady and Larry Guth and Fedor Manin},
journal= {arXiv preprint arXiv:1908.02824},
year = {2020}
}
Comments
21 pages, final version to appear in Selecta Math