Pages that link to "Item:Q4891748"
From MaRDI portal
The following pages link to Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants (Q4891748):
Displayed 6 items.
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811) (← links)
- Index reduction for differential-algebraic equations by substitution method (Q947691) (← 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)
- 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)
