Login / Signup
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results.
Karthik C. S.
Pasin Manurangsi
Published in:
Electron. Colloquium Comput. Complex. (2024)
Keyphrases
</>
np hardness
approximation algorithms
np hard
worst case analysis
mixed integer
worst case
lower bound
genetic algorithm
special case
learning algorithm
multi agent
optimization problems
np complete
mathematical model
temporal logic