Pages that link to "Item:Q3009769"
From MaRDI portal
The following pages link to Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation (Q3009769):
Displaying 5 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)
- Computing the maximum degree of minors in matrix pencils via combinatorial relaxation (Q1402222) (← links)
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387) (← links)
- Computing the Degree of Determinants via Combinatorial Relaxation (Q4852623) (← links)