ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Pe∅P e\varnothing be a rational polytope in R3\mathbb{R}^3. The Polytope Translation hardness conjecture. The Polytope Translation problem for rational polytopes P⊂R3P\subset \mathbb{R}^3 is NP{\textup{\textsf{NP}}}-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 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.