Computational complexity in algebraic combinatorics

MaRDI QIDQ6937137zbMATH OpenFDO

Authors Greta Panova

Publication date 28 August 2025

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Cited in

(4)

• Deterministically approximating the volume of a Kostka polytope
• Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
• Positivity of Schubert coefficients
• Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz

This page was built for publication: Computational complexity in algebraic combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6937137)