Pages that link to "Item:Q4138004"

The following pages link to Some bilinear forms whose multiplicative complexity depends on the field of constants (Q4138004):

Displaying 29 items.

• Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
• Commutative algebras of minimal rank (Q595370) (← links)
• Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
• The multiplicative complexity of certain semilinear systems defined by polynomials (Q786509) (← links)
• On the direct sum conjecture (Q801142) (← links)
• Rank and optimal computation of generic tensors (Q1051066) (← links)
• Special algorithms for convolutions over Galois fields (Q1071810) (← links)
• A lower bound for polynomial multiplication (Q1086218) (← links)
• Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u]/<Q(u)^{\ell}>\), \(\ell >1\) (Q1110328) (← links)
• On the algorithmic complexity of associative algebras (Q1154260) (← links)
• Direct sums of bilinear algorithms (Q1157377) (← links)
• On the complexity of multiplication in finite fields (Q1171378) (← links)
• Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u]/\langle{} u^ n \rangle\) (Q1178708) (← links)
• On multiplication in algebraic extension fields (Q1256512) (← links)
• On the multiplicative complexity of the discrete Fourier transform (Q1259162) (← links)
• On the direct sum conjecture in the straight line model (Q1265137) (← links)
• Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
• Fast structured matrix computations: tensor rank and Cohn-Umans method (Q1704813) (← links)
• Gaps between prime numbers and tensor rank of multiplication in finite fields (Q1727373) (← links)
• Structure of algebras of commutative matrices (Q1906768) (← links)
• Trisymmetric multiplication formulae in finite fields (Q2232213) (← links)
• Generalization of the algebraic discrete Fourier transform with application to fast convolutions (Q2277806) (← links)
• Paraunitary matrices, entropy, algebraic condition number and Fourier computation (Q2304569) (← links)
• The equivariant complexity of multiplication in finite field extensions (Q2693365) (← links)
• Is computing with the finite Fourier transform pure or applied mathematics? (Q3931844) (← links)
• On Computing the Discrete Fourier Transform (Q4151723) (← links)
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry (Q4992045) (← links)
• The quadratic hull of a code and the geometric view on multiplication algorithms (Q5043439) (← links)
• Algebraic complexities and algebraic curves over finite fields (Q5903919) (← links)