Pages that link to "Item:Q3891765"
From MaRDI portal
The following pages link to New Fast Algorithms for Matrix Operations (Q3891765):
Displayed 13 items.
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- On the synthesis of fast algorithms for signal processing (Q753422) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- Relations between exact and approximate bilinear algorithms. Applications (Q1152203) (← links)
- The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952) (← links)
- On the algorithmic complexity of associative algebras (Q1154260) (← links)
- New combinations of methods for the acceleration of matrix multiplication (Q1154805) (← links)
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication (Q1158927) (← links)
- Computing lower bounds on tensor rank over finite fields (Q1165577) (← links)
- Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
- On the asymptotic complexity of rectangular matrix multiplication (Q1173402) (← links)
- Randomised algorithms (Q1836980) (← links)
- Two new algorithms for matrix multiplication and vector convolution (Q3123351) (← links)