The quiver problem is NP-complete

DOI10.1016/J.JALGEBRA.2026.02.027MaRDI QIDQ7228759zbMATH OpenFDO

Authors Victor G. Kac, Bangzheng Li

Publication date 14 April 2026

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JALGEBRA.2026.02.027

zbMATH Keywords

NP-complete problemquiver3-CNF formulaShur representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Representations of quivers and partially ordered sets (16G20)

Cites work

• Infinite root systems, representations of graphs and invariant theory
• On complexity of representations of quivers

This page was built for publication: The quiver problem is NP-complete

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