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 3 items.
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811) (← links)
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices (Q3121390) (← 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)
