Algebraic complexities and algebraic curves over finite fields

DOI10.1016/0885-064X(88)90012-XzbMath0668.68040MaRDI QIDQ5903919

Publication date: 1988

Published in: Journal of Complexity (Search for Journal in Brave)

finite ground field algebraic curves Goppa codes multiplication coding theory algebras over finite fields algebraic geometrical methods minimal algebraic complexities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic theory of algebraic function fields (11R58) Arithmetic ground fields for curves (14H25) Riemann-Roch theorems (14C40) Finite ground fields in algebraic geometry (14G15) Arithmetic codes (94B40) Algebraic functions and function fields in algebraic geometry (14H05)

Related Items

An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields, A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line, The tensor rank of semifields of order 16 and 81, Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields, The quadratic hull of a code and the geometric view on multiplication algorithms, Non-minimum tensor rank Gabidulin codes, Complexity of computation in finite fields, On some bounds for symmetric tensor rank of multiplication in finite fields, Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms, Chudnovsky-type algorithms over the projective line using generalized evaluation maps, Normal bases from 1-dimensional algebraic groups, Rank classification of tensors over, 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, Finite field arithmetic in large characteristic for classical and post-quantum cryptography, On the tensor rank of multiplication in any extension of \(\mathbb F_2\), The equivariant complexity of multiplication in finite field extensions, Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method, Unnamed Item, Multiplication algorithm in a finite field and tensor rank of the multiplication., On the tensor rank of the multiplication in the finite fields, 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, Complexity of multiplication in commutative group algebras over fields of prime characteristic, Trisymmetric multiplication formulae in finite fields, On fast multiplication of polynomials over arbitrary algebras, Faster Polynomial Multiplication via Discrete Fourier Transforms, Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication, Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm, On multiplication in finite fields, Canonical forms of order-k(k= 2, 3, 4) symmetric tensors of format 3 × … × 3 over prime fields, Multiplication of polynomials modulo \(x^n\), 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 bilinear complexity of the multiplication in small finite fields, Elliptic periods for finite fields, The maximum rank of 2 × ⋯ × 2 tensors over 𝔽₂, Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\), 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, Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm, Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15

Cites Work