Pages that link to "Item:Q1894574"
From MaRDI portal
The following pages link to Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form (Q1894574):
Displaying 11 items.
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811) (← links)
- Legendre duality in combinatorial study of matrix pencils (Q691986) (← links)
- Index reduction for differential-algebraic equations by substitution method (Q947691) (← links)
- Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions (Q1895106) (← links)
- Finding optimal minors of valuated bimatroids (Q1895110) (← links)
- Well-layered maps---a class of greedily optimizable set functions (Q1904519) (← links)
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387) (← links)
- Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769) (← links)
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices (Q3121390) (← links)
- Index Reduction via Unimodular Transformations (Q3176353) (← links)
- A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices (Q6120836) (← links)
