The following pages link to How to multiply matrices faster (Q799337):
Displaying 50 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- On the arithmetic complexity of Strassen-like matrix multiplications (Q346560) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- Speedup for natural problems and noncomputability (Q620964) (← links)
- On multivariate polynomials in Bernstein-Bézier form and tensor algebra (Q651114) (← links)
- Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (Q685715) (← links)
- Information-based complexity: New questions for mathematicians (Q751814) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- Bit complexity of matrix products (Q808706) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- On the complexity of a pivot step of the revised simplex algorithm (Q1068713) (← links)
- On transformations of algorithms to multiply 2\(\times 2\) matrices (Q1069698) (← links)
- A non-recursive algorithm for classifying the states of a finite Markov chain (Q1082271) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Parallel nested dissection for path algebra computations (Q1095781) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986) (← links)
- Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field (Q1111375) (← links)
- An improved parallel algorithm that computes the BFS numbering of a directed graph (Q1111392) (← links)
- Bilinear mincing rank (Q1115593) (← links)
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
- Matrix structures in parallel matrix computations (Q1122309) (← links)
- On practical algorithms for accelerated matrix multiplication (Q1183208) (← links)
- Statistical complexity of dominant eigenvector calculation (Q1186505) (← links)
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix (Q1186509) (← links)
- Extended concept of significant digits and lower precision computations (Q1186953) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- On the direct sum conjecture in the straight line model (Q1265137) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Using fast matrix multiplication to find basic solutions (Q1275090) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Oracle computations in parallel numerical linear algebra (Q1325837) (← links)
- On the complexity of linear quadratic control (Q1330536) (← links)
- Rectangular matrix multiplication revisited (Q1361875) (← links)
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks (Q1361878) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Algorithms for fast convolutions on motion groups (Q1582144) (← links)
- FFT-like multiplication of linear differential operators (Q1599537) (← links)
- Matrix multiplication for finite algebraic systems (Q1813190) (← links)
- Fast finite methods for a system of linear inequalities (Q1819897) (← links)
- Efficient parallel linear programming (Q1821686) (← links)
- Fast and efficient solution of path algebra problems (Q1824392) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Binary segmentation for matrix and vector operations (Q2365929) (← links)
- Guessing singular dependencies (Q2437325) (← links)
- Fast and efficient linear programming and linear least-squares computations (Q3028716) (← links)
