Pages that link to "Item:Q1950387"
From MaRDI portal
The following pages link to Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387):
Displaying 9 items.
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811) (← links)
- 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)
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices (Q3121390) (← links)
- Computing the Degree of Determinants via Combinatorial Relaxation (Q4852623) (← links)
- Computing the combinatorial canonical form of a layered mixed matrix (Q4946715) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils (Q5278177) (← 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)
