An improvement of bilinear complexity bounds in some finite fields.

DOI10.1016/j.crma.2004.06.011zbMath1101.11049OpenAlexW1999552597MaRDI QIDQ1887000

Jean Chaumine, Stéphane Ballet

Publication date: 23 November 2004

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.2004.06.011

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Cites Work

• Unnamed Item
• Algebraic function fields and codes
• 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.
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• On tame towers over finite fields

This page was built for publication: An improvement of bilinear complexity bounds in some finite fields.