Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
From MaRDI portal
Publication:432769
DOI10.1016/j.jco.2012.02.005zbMath1246.65260arXiv1107.0336OpenAlexW1965402211MaRDI QIDQ432769
Publication date: 4 July 2012
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.0336
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Complexity and performance of numerical algorithms (65Y20)
Related Items (16)
The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ On some bounds for symmetric tensor rank of multiplication in finite fields ⋮ Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms ⋮ Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of \(\mathbb{F}_2\) and \(\mathbb{F}_3\) ⋮ Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity ⋮ The equivariant complexity of multiplication in finite field extensions ⋮ Dense families of modular curves, prime numbers and uniform symmetric tensor rank of multiplication in certain finite fields ⋮ Gaps between prime numbers and tensor rank of multiplication in finite fields ⋮ Trisymmetric multiplication formulae in finite fields ⋮ On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation ⋮ Improved method for finding optimal formulas for bilinear maps in a finite field ⋮ On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields ⋮ Unnamed Item ⋮ Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \((2,1)\)-separating systems beyond the probabilistic bound
- Algebraic function fields and codes
- On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\)
- On the tensor rank of the multiplication in the finite fields
- On multiplication in finite fields
- Rank and optimal computation of generic tensors
- Lectures on the complexity of bilinear problems
- Low-discrepancy sequences and global function fields with many rational places
- Multiplication algorithm in a finite field and tensor rank of the multiplication.
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- On the tensor rank of multiplication in any extension of \(\mathbb F_2\)
- Gaussian elimination is not optimal
- Torsion Limits and Riemann-Roch Systems for Function Fields and Applications
- Geometry and the complexity of matrix multiplication
- On the existence of dimension zero divisors in algebraic function fields defined over Fq
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- A new approach to error-correcting codes
- Some bilinear forms whose multiplicative complexity depends on the field of constants
- Algebras Having Linear Multiplicative Complexities
- Asymptotic bounds on frameproof codes
- Abelian varieties over finite fields
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Algebraic complexities and algebraic curves over finite fields
This page was built for publication: Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
