Classical computation of Kronecker coefficients within the dimension-product runtime

Establish whether, for partitions λ, μ, ν of n satisfying f^λ ≥ f^μ ≥ f^ν, the Kronecker coefficient g(λ, μ, ν) can be computed by a classical algorithm in time O(f^μ f^ν f^λ poly(n)).

Background

The paper proves polynomial-time classical algorithms for broad families of Kronecker coefficients, including cases where one representation dimension is polynomially bounded. These results refute some previously proposed conjectures that quantum algorithms would outperform classical algorithms in those regimes. Conjecture 1.3 proposes a general classical runtime proportional to the product of the three relevant Specht-module dimensions, but the paper does not establish it for all triples.