Pages that link to "Item:Q1173402"
From MaRDI portal
The following pages link to On the asymptotic complexity of rectangular matrix multiplication (Q1173402):
Displayed 4 items.
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- Efficient parallel linear programming (Q1821686) (← links)
- Fast and efficient linear programming and linear least-squares computations (Q3028716) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)