Pages that link to "Item:Q521811"
From MaRDI portal
The following pages link to Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811):
Displaying 7 items.
- Computing the maximum degree of minors in matrix pencils via combinatorial relaxation (Q1402222) (← links)
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form (Q1894574) (← links)
- Finding optimal minors of valuated bimatroids (Q1895110) (← links)
- Two algorithms for valuated \(\Delta\)-matroids (Q1921193) (← links)
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387) (← 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)
