arXiv:1908.10157 [math.RT]AbstractReferencesReviewsResources
On complexity of representations of quivers
Published 2019-08-27Version 1
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.
Related articles: Most relevant | Search more
arXiv:1905.03366 [math.RT] (Published 2019-05-08)
Representations and cohomology of a family of finite supergroup schemes
arXiv:0709.2488 [math.RT] (Published 2007-09-16)
Complexity of matrix problems
arXiv:1602.01361 [math.RT] (Published 2016-02-03)
Complexity of simple modules over the Lie superalgebra $\mathfrak{osp}(k|2)$