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 the normal view instead:
scientific article; zbMATH DE number 6991114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructive non-commutative rank computation is in deterministic polynomial time |
scientific article; zbMATH DE number 6991114 |
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
0.9176730513572692
0 references
0.8155604600906372
0 references
0.8043411374092102
0 references
0.7873411774635315
0 references
