Pages that link to "Item:Q4402461"
From MaRDI portal
The following pages link to Triangular Factorization and Inversion by Fast Matrix Multiplication (Q4402461):
Displayed 21 items.
- A fast algorithm to construct a representation for transversal matroids (Q263073) (← links)
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- On efficient calculations for Bayesian variable selection (Q434881) (← links)
- Efficiently hex-meshing things with topology (Q471135) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- Structural control of single-input rank one bilinear systems (Q899250) (← links)
- Upper bounds on the complexity of solving systems of linear equations (Q1057647) (← links)
- Fast algorithms for the characteristic polynomial (Q1058849) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- On the implementation of Strassen's fast multiplication algorithm (Q1219685) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition (Q2437224) (← links)
- On the complexity of matrix reduction over finite fields (Q2467342) (← links)
- Algebraic Algorithms for Linear Matroid Parity Problems (Q2799476) (← links)
- Fast Generalized Bruhat Decomposition (Q3589076) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)