A hardness of approximation result in metric geometry
We show that it is NP-hard to approximate the hyperspherical radius of a triangulated manifold up to an almost-polynomial factor.
READ FULL TEXTWe show that it is NP-hard to approximate the hyperspherical radius of a triangulated manifold up to an almost-polynomial factor.
READ FULL TEXT