Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ITCS.2017.55 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ITCS.2017.55 / rank
 
Normal rank

Latest revision as of 14:56, 30 December 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

    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references