ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥3d \geq 3 and let PP be a lattice dd-polytope. Lattice-polytope diameter conjecture. Computing a lattice diameter of PP is an NP⁡\operatorname{\mathsf{NP}}-hard problem. This would extend the established NP-hardness result from bounded semi-algebraic sets, even when the diameter direction is fixed, to lattice polytopes.

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.