Pages that link to "Item:Q5234537"

The following pages link to Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537):

Displaying 11 items.

• Computing the discrete compactness of orthogonal pseudo-polytopes via their \(n\)D-EVM representation (Q1958864) (← 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)
• Computing valuations of the Dieudonné determinants (Q2100059) (← links)
• A cost-scaling algorithm for computing the degree of determinants (Q2159472) (← links)
• Uniform modular lattices and affine buildings (Q2194712) (← links)
• On a weighted linear matroid intersection algorithm by deg-det computation (Q2227314) (← links)
• Computing the Degree of Determinants via Combinatorial Relaxation (Q4852623) (← links)
• Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces (Q4959125) (← 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)
• Algebraic algorithms for fractional linear matroid parity via noncommutative rank (Q6670353) (← links)