Recursive muffin-algorithm value conjecture
Statement
Let be a 3M-DAP that is not a 0-problem, and let be the smaller 3M-DAP obtained from by one application of the recursive algorithm. Let denote the size of the smallest piece in the solution produced by that algorithm.
Recursive value conjecture. For any 3M-DAP that is not a 0-problem,
The source says that it proves this conjecture in the subsequent analysis. Therefore its status is solved.
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.