Pages that link to "Item:Q2191009"

The following pages link to On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field (Q2191009):

Displaying 7 items.

• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
• On the additive complexity of 2 \(\times 2\) matrix multiplication (Q672835) (← links)
• On the approximate bilinear complexity of matrix multiplication (Q891131) (← links)
• On the bounds of the bilinear complexity of multiplication in some finite fields (Q1762551) (← links)
• A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)
• A lower bound for bilinear complexity of matrix multiplication over a finite field (Q6545499) (← links)