Some bilinear forms whose multiplicative complexity depends on the field of constants

DOI10.1007/BF01683270zbMath0363.65014OpenAlexW1985896262MaRDI QIDQ4138004

Publication date: 1977

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01683270

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation of special functions and constants, construction of tables (65D20)

Related Items (29)

On Computing the Discrete Fourier Transform ⋮ The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ A lower bound for polynomial multiplication ⋮ Multiplicative complexity of direct sums of quadratic systems ⋮ Structure of algebras of commutative matrices ⋮ 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\)] ⋮ Commutative algebras of minimal rank ⋮ Automatic derivation and implementation of fast convolution algorithms ⋮ The equivariant complexity of multiplication in finite field extensions ⋮ On the algorithmic complexity of associative algebras ⋮ Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method ⋮ Fast structured matrix computations: tensor rank and Cohn-Umans method ⋮ Direct sums of bilinear algorithms ⋮ On the complexity of multiplication in finite fields ⋮ Gaps between prime numbers and tensor rank of multiplication in finite fields ⋮ 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\)] ⋮ Trisymmetric multiplication formulae in finite fields ⋮ Algebraic complexities and algebraic curves over finite fields ⋮ Generalization of the algebraic discrete Fourier transform with application to fast convolutions ⋮ On multiplication in algebraic extension fields ⋮ On the multiplicative complexity of the discrete Fourier transform ⋮ On the direct sum conjecture in the straight line model ⋮ Paraunitary matrices, entropy, algebraic condition number and Fourier computation ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ The multiplicative complexity of certain semilinear systems defined by polynomials ⋮ Is computing with the finite Fourier transform pure or applied mathematics? ⋮ Rank and optimal computation of generic tensors ⋮ On the direct sum conjecture ⋮ Special algorithms for convolutions over Galois fields

Cites Work

This page was built for publication: Some bilinear forms whose multiplicative complexity depends on the field of constants