On complexity of representations of quivers
arXiv:1908.10157
Abstract
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.
7 pages Typos are corrected
arXiv:1908.10157
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.
7 pages Typos are corrected