Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769)

From MaRDI portal
Revision as of 04:43, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
scientific article

    Statements

    Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (English)
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    maximum degree of minors
    0 references
    polynomial matrix
    0 references
    combinatorial relaxation algorithm
    0 references
    matching problem
    0 references
    Kronecker canonical form
    0 references
    matrix pencil
    0 references
    assignment problem
    0 references
    0 references
    0 references

    Identifiers

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