Gaps between prime numbers and tensor rank of multiplication in finite fields
From MaRDI portal
Publication:1727373
DOI10.1007/s10623-018-0584-0zbMath1428.12001arXiv1801.01055OpenAlexW2964093395WikidataQ128984644 ScholiaQ128984644MaRDI QIDQ1727373
Publication date: 20 February 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.01055
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Computational aspects of algebraic curves (14Q05) Primes (11A41) Computational methods for problems pertaining to field theory (12-08)
Related Items
Trisymmetric multiplication formulae in finite fields ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \((2,1)\)-separating systems beyond the probabilistic bound
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Algebraic function fields and codes
- On the tensor rank of the multiplication in the finite fields
- On multiplication in finite fields
- On the complexity of multiplication in finite fields
- A lower bound for the multiplication of polynomials modulo a polynomial
- On the optimal evaluation of a set of bilinear forms
- The distribution of totients
- Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
- Multiplication algorithm in a finite field and tensor rank of the multiplication.
- Explicit estimates of some functions over primes
- Dense families of modular curves, prime numbers and uniform symmetric tensor rank of multiplication in certain finite fields
- An explicit result for primes between cubes
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- Short effective intervals containing primes
- The Difference Between Consecutive Primes, II
- On products and powers of linear codes under componentwise multiplication
- Torsion Limits and Riemann-Roch Systems for Function Fields and Applications
- Short effective intervals containing primes in arithmetic progressions and the seven cubes problem
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- A new approach to error-correcting codes
- Some bilinear forms whose multiplicative complexity depends on the field of constants
- Algebraic complexities and algebraic curves over finite fields
- Algebraic complexities and algebraic curves over finite fields
