Constructive non-commutative rank computation is in deterministic polynomial time (Q4638110)
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 6866345
| 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 6866345 |
Statements
3 May 2018
0 references
invariant theory
0 references
non-commutative rank
0 references
null cone
0 references
symbolic determinant identity testing
0 references
semi-invariants of quivers
0 references
0 references
0 references
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (English)
0 references
0.9176730513572692
0 references
0.8588666319847107
0 references
0.8556485176086426
0 references
0.8050060868263245
0 references
0.7988672256469727
0 references
