A hardness of approximation result in metric geometry
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.
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer International Publishing
2021
|
| Online Access: | https://hdl.handle.net/1721.1/131412 |