Login / Signup
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results.
Karthik C. S.
Pasin Manurangsi
Published in:
CoRR (2023)
Keyphrases
</>
np hardness
approximation algorithms
np hard
worst case
lower bound
mixed integer
np complete
special case
worst case analysis
computational complexity
optimal solution
evolutionary algorithm
upper bound
maximum likelihood
discrete tomography