NP-hardness of computing lattice diameters of lattice polytopes
Statement
Let and let be a lattice -polytope. Lattice-polytope diameter conjecture. Computing a lattice diameter of is an -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.