Pages that link to "Item:Q1223163"
From MaRDI portal
The following pages link to On the complexity of quaternion multiplication (Q1223163):
Displaying 10 items.
- Multiplicative complexity and algebraic structure (Q1053459) (← links)
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping (Q1131837) (← links)
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication (Q1131838) (← links)
- On varieties of optimal algorithms for the computation of bilinear mappings. III. Optimal algorithms for the computation of \(xy\) and \(yx\) where \(x,y\in M_2(K)\) (Q1146511) (← links)
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics (Q1240771) (← links)
- The complexity of vector-products (Q1243128) (← links)
- Some elementary proofs of lower bounds in complexity theory (Q1245277) (← links)
- Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
- Some fast algorithms multiplying a matrix by its adjoint (Q2674011) (← links)
- Generalizing Frobenius inversion to quaternion matrices (Q6590594) (← links)
