Cites work
Cited in
(10)- Fast algorithms for the characteristic polynomial
- Computational methods of linear algebra
- Essentially optimal computation of the inverse of generic polynomial matrices
- Fast rectangular matrix multiplication and QR decomposition
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Tensors in computations
- Some computational problems in linear algebra as hard as matrix multiplication
- On matrix multiplication and polynomial identity testing
- Grassmannian optimization is NP-hard
- Dynamic matrix rank
This page was built for publication: Unitäre Transformationen großer Matrizen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557539)