It is NP-hard to approximate the hyperspherical radius of triangulated surfaces and triangulated high-dimensional spheres to within any almost-polynomial factor.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DG 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A hardness of approximation result in metric geometry
It is NP-hard to approximate the hyperspherical radius of triangulated surfaces and triangulated high-dimensional spheres to within any almost-polynomial factor.