Pages that link to "Item:Q1154805"
From MaRDI portal
The following pages link to New combinations of methods for the acceleration of matrix multiplication (Q1154805):
Displayed 11 items.
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- On the order of approximation in approximative triadic decompositions of tensors (Q1123957) (← links)
- The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952) (← links)
- Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication (Q1157169) (← links)
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication (Q1158927) (← links)
- The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic (Q1165575) (← links)
- Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
- On the asymptotic complexity of rectangular matrix multiplication (Q1173402) (← links)
- On practical algorithms for accelerated matrix multiplication (Q1183208) (← links)
- Two new algorithms for matrix multiplication and vector convolution (Q3123351) (← links)