Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructive non-commutative rank computation is in deterministic polynomial time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructive non-commutative rank computation is in deterministic polynomial time |
scientific article |
Statements
Constructive non-commutative rank computation is in deterministic polynomial time (English)
0 references
10 December 2018
0 references
Edmonds' problem
0 references
symbolic determinant identity test
0 references
semi-invariants of quivers
0 references
non-commutative rank
0 references
0 references
0 references
