Criterion of NP-hardness for properly posed problems
Statement
Let be a properly posed problem, and let denote the positive canonical dual feasible set; write for its interior. Criterion of NP-hardness. The problem is NP-hard if and only if
This conjecture connects the computational difficulty of the nonconvex problem with the geometry of its canonical dual feasible set. The supplied text attributes the proposal to Gao and collaborators, but gives no resolution, so its status remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.