Uniqueness in quadratic and hyperbolic 0-1 programming problems
classification
🧮 math.CO
cs.CC
keywords
classcomplexityhyperbolicprogrammingquadraticuniquenessanalyzecomplete
read the original abstract
We analyze the question of deciding whether a quadratic or a hyperbolic 0-1 programming instance has a unique optimal solution. Both uniqueness questions are known to be NP-hard, but are unlikely to be contained in the class NP. We precisely pinpoint their computational complexity by showing that they both are complete for the complexity class {\mbox{$\Delta_2$P}.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.