Pages that link to "Item:Q1173402"
From MaRDI portal
The following pages link to On the asymptotic complexity of rectangular matrix multiplication (Q1173402):
Displayed 10 items.
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- Efficient parallel linear programming (Q1821686) (← links)
- Subquadratic-time algorithms for normal bases (Q2040602) (← links)
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets (Q2059797) (← links)
- Improved distance sensitivity oracles with subcubic preprocessing time (Q2237898) (← links)
- Fast and efficient linear programming and linear least-squares computations (Q3028716) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Bounds and algorithms for graph trusses (Q5119376) (← links)
- Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. (Q5874551) (← links)