On complexity of representations of quivers
© 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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier BV,
2021-11-05T15:14:50Z.
|
| Subjects: | |
| Online Access: | Get fulltext |