Three-dimensional Polytope Translation hardness conjecture
Statement
Let be a rational polytope in . The Polytope Translation hardness conjecture. The Polytope Translation problem for rational polytopes is -hard. This conjecture asks whether the known hardness result in dimension six can be reduced to dimension three; the source presents it as an open problem.
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.