A hardness of approximation result in metric geometry

08/07/2019
by   Zarathustra Brady, et al.
0

We show that it is NP-hard to approximate the hyperspherical radius of a triangulated manifold up to an almost-polynomial factor.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2019

The Projection Games Conjecture and the Hardness of Approximation of SSAT and related problems

The Super-SAT or SSAT problem was introduced by Dinur, Kindler, Raz and ...
research
11/15/2022

Shellability is hard even for balls

The main goal of this paper is to show that shellability is NP-hard for ...
research
10/07/2021

Bad-Policy Density: A Measure of Reinforcement Learning Hardness

Reinforcement learning is hard in general. Yet, in many specific environ...
research
02/19/2015

NP-Hardness and Inapproximability of Sparse PCA

We give a reduction from clique to establish that sparse PCA is NP-hard...
research
02/08/2019

Detecting mixed-unitary quantum channels is NP-hard

A quantum channel is said to be a mixed-unitary channel if it can be exp...
research
06/08/2020

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Parameterization and approximation are two popular ways of coping with N...

Please sign up or login with your details

Forgot password? Click here to reset