Classical output-sensitive algorithm conjecture for Littlewood–Richardson coefficients
Statement
Let , , and be partitions such that . Littlewood–Richardson algorithm conjecture. There exists a classical algorithm running in time
that computes the Littlewood–Richardson coefficient . The conjecture is a proposed classical counterpart to the known quantum runtime, with polynomial-time algorithms already available in some restricted cases such as fixed ; the general case remains open.
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.