Is the pseudo-polynomial running time of the known algorithms for testing extremality of minimal valid functions in the single-row infinite group problem best possible?
Statement
Is the pseudo-polynomial running time of the known algorithms for testing extremality of minimal valid functions in the single-row infinite group problem best possible?
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.