Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8166/pdf/LIPIcs-ITCS-2017-55.pdf/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2794923896 / rank | |||
Normal rank | |||
| Property / title | |||
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (English) | |||
| Property / title: Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (English) / rank | |||
Normal rank | |||
Revision as of 10:25, 30 July 2024
scientific article; zbMATH DE number 6866345
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
