NP-hardness conjecture for recognizing f-vectors of fixed-dimensional polytopes
Statement
Let be fixed. An -vector is a vector recording the face numbers of a -polytope, here written as
NP-hardness conjecture. It is NP-hard to decide if a given -bit vector of positive integers is the -vector of a -polytope.
This conjecture is proposed as an explanation for why the -vectors of -polytopes are poorly understood when . Its status is not specified in the source.
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.