Dimension-product classical algorithm for Littlewood–Richardson coefficients

Establish whether, for partitions λ, μ, and ν with |λ| = |μ| + |ν|, there exists a classical algorithm running in time O(f^λ f^μ f^ν poly(n)) that computes the Littlewood–Richardson coefficient c^λ_{μν}.

Background

The paper gives several classical algorithms for Littlewood–Richardson coefficients, including polynomial-time methods for fixed-length cases and exponential-time procedures based on tableau generation. These results do not resolve whether the runtime can generally be bounded by the product of the dimensions of the associated representations, up to a polynomial factor. The conjecture reiterates a proposed classical analogue of the quantum computation bound.