The BoxContZonotope NP-hardness conjecture
Statement
Let and let . BoxContZonotope conjecture. Deciding whether there exists a rectangular box such that
is -hard. The problem is introduced as a further source of computational intractability in determining , beyond volume computation alone; no proof or resolution is supplied.
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.