NP-hardness of the CONVEX coordinate-projection problem for rotation matrices
Statement
Let . Define the decision problem to output TRUE if the projection is convex, and FALSE otherwise. NP-hardness conjecture. The problem is NP-hard. This conjecture concerns the computational complexity of characterizing which coordinate projections of are convex. The paper gives a complete characterization for coordinate subsets of , up to permutations and transposition, but the general complexity 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.