Pages that link to "Item:Q891131"

The following pages link to On the approximate bilinear complexity of matrix multiplication (Q891131):

Displaying 10 items.

• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
• On commutativity and approximation (Q799369) (← links)
• The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
• On the complexity of the multiplication of matrices of small formats (Q1394936) (← links)
• On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field (Q2191009) (← links)
• Refining the upper bound for the cardinality of the definition domain of universal functions for a class of linear Boolean functions (Q2191017) (← links)
• A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
• Relative bilinear complexity and matrix multiplication. (Q3757395) (← links)
• Approximate computation of scalar products (Q5903776) (← links)
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)