Pages that link to "Item:Q4842560"

The following pages link to A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices (Q4842560):

Displayed 11 items.

• On the complexity of submodular function minimisation on diamonds (Q665998) ‎ (← links)
• Computing DM-decomposition of a partitioned matrix with rank-1 blocks (Q1747895) ‎ (← links)
• A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices (Q2061866) ‎ (← links)
• A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices (Q2089763) ‎ (← links)
• A cost-scaling algorithm for computing the degree of determinants (Q2159472) ‎ (← links)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) ‎ (← links)
• Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces (Q4959125) ‎ (← links)
• Signed ring families and signed posets (Q4999327) ‎ (← links)
• A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 $$\times $$ 2 Submatrices (Q5041746) ‎ (← links)
• Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) ‎ (← 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)