Pages that link to "Item:Q4959125"
From MaRDI portal
The following pages link to Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces (Q4959125):
Displaying 10 items.
- 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)
- Computing valuations of the Dieudonné determinants (Q2100059) (← 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)
- Old and new challenges in Hadamard spaces (Q6052560) (← links)
- Connections between graphs and matrix spaces (Q6074039) (← links)
- Submodule codes as spherical codes in buildings (Q6101273) (← 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)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
