ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Q⊆RnQ\subseteq\mathbb R^n be a polyhedral cone, and let MA(P,Q){\rm MA}(P,Q) denote the problem of computing the maximal angle between cones PP and QQ. Orthant-restriction conjecture. Computing the maximal angle between R+n\mathbb R^n_+ and a polyhedral cone Q⊆RnQ\subseteq\mathbb R^n is NP-hard, that is, solving MA(R+n,Q){\rm MA}(\mathbb R^n_+,Q) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.