On complexity of representations of quivers
Author(s)
Kac, Victor
DownloadSubmitted version (125.0Kb)
Publisher with Creative Commons License
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
© 2019 Académie des sciences It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.
Date issued
2019Department
Massachusetts Institute of Technology. Department of MathematicsJournal
Comptes Rendus Mathematique
Publisher
Elsevier BV
Citation
Kac, Victor G. 2019. "On complexity of representations of quivers." Comptes Rendus Mathematique, 357 (11-12).
Version: Original manuscript