On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation

DOI10.1016/J.CRMA.2017.06.002zbMATH Open1367.11090OpenAlexW2625324095MaRDI QIDQ2012337FDOQ2012337

S. Ballet, Mila Tukumuli, Alexis Bonnecaze, Nicolas Baudru

Publication date: 31 July 2017

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2017.06.002

zbMATH Keywords

tensor rankbilinear complexityChudnovsky algorithm

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic complexities and algebraic curves over finite fields
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields

Cited In (2)

• 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

This page was built for publication: On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012337)