Output-sensitive classical algorithm conjecture for Kronecker coefficients
Statement
Let , , and be partitions of , and suppose that . Kronecker algorithm conjecture. The Kronecker coefficient can be computed by a classical algorithm in time
The conjecture is posed as the opposite of the paper’s refuted expectation that no analogous classical algorithm exists for Kronecker coefficients. The paper proves efficient classical algorithms in substantial regimes, but the conjecture remains open in full generality.
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.