Uniqueness in quadratic and hyperbolic 0-1 programming problems

Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger

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}.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment