Pages that link to "Item:Q4047031"

The following pages link to Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms (Q4047031):

Displaying 33 items.

• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
• Numerical CP decomposition of some difficult tensors (Q508007) (← links)
• On the additive complexity of 2 \(\times 2\) matrix multiplication (Q672835) (← links)
• On the synthesis of fast algorithms for signal processing (Q753422) (← links)
• The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
• On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping (Q1131837) (← links)
• Using duality for the synthesis of an optimal algorithm involving matrix multiplication (Q1154261) (← links)
• New combinations of methods for the acceleration of matrix multiplication (Q1154805) (← links)
• Dual problems of multiplication of a vector by a matrix (Q1164962) (← links)
• Some elementary proofs of lower bounds in complexity theory (Q1245277) (← links)
• On the optimal evaluation of a set of bilinear forms (Q1245572) (← links)
• Global properties of tensor rank (Q1250855) (← links)
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication (Q1253097) (← links)
• Using duality to compute the pair of matrix products \(QY\) and \(Y^TQ\) over a noncommutative ring (Q1254089) (← links)
• Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
• On a signal processing algorithms based class of linear codes (Q1803557) (← links)
• A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications (Q1819890) (← links)
• Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
• Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
• An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
• A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
• Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications (Q4085178) (← links)
• An extended duality theorem and multiplication of several matrices (Q4100216) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• Stand-alone results and applications in multilinear algebra (Q4748296) (← links)
• (Q5239688) (← links)
• A fast algorithm for reversion of power series (Q5497035) (← links)
• Algebraic complexities and algebraic curves over finite fields (Q5903919) (← links)
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\) (Q6082202) (← links)
• Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
• A lower bound for bilinear complexity of matrix multiplication over a finite field (Q6545499) (← links)
• Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities (Q6631548) (← links)