NP-hardness of maximal angle computation for the nonnegative orthant
Statement
Let be a polyhedral cone, and let denote the problem of computing the maximal angle between cones and . Orthant-restriction conjecture. Computing the maximal angle between and a polyhedral cone is NP-hard, that is, solving is NP-hard. The preceding result establishes NP-hardness when the first cone is generated by a subset of the canonical basis; the conjecture asks whether NP-hardness persists when the first cone is the full nonnegative orthant.
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.