Fixed-dimensional simplex Polytope Translation hardness conjecture
Statement
For some fixed positive integer , let be a rational simplex. The simplex Polytope Translation hardness conjecture. For some fixed , the Polytope Translation problem for rational simplices is -hard. This is proposed as a stronger simplification of the general polytope hardness result, and the source leaves it 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.