Pages that link to "Item:Q672835"

The following pages link to On the additive complexity of 2 \(\times 2\) matrix multiplication (Q672835):

Displaying 6 items.

• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
• On the fraction of matrices with maximal additive complexity (Q2629752) (← links)
• Some fast algorithms multiplying a matrix by its adjoint (Q2674011) (← links)
• Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform (Q3985183) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)