On complexity of representations of quivers

From MaRDI portal




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.











This page was built for publication: On complexity of representations of quivers

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