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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Solutions of Matrix Problems Over an Integral Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast multiplication of polynomials over arbitrary algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Algorithms for Matching and Matroid Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the maximum degree of minors in matrix pencils via combinatorial relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial relaxation algorithm for mixed polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Kronecker Canonical Form of Mixed Matrix Pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matchings in planar graphs via Gaussian elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems analysis by graphs and matroids. Structural solvability and controllability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Degree of Determinants via Combinatorial Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection I: Optimality Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection II: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Degree of Mixed Polynomial Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices and matroids for systems analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems— / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight bipartite matching in matrix multiplication time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The singular pencil of a linear dynamical system† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational matrix structure / rank
 
Normal rank

Latest revision as of 04:43, 4 July 2024

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