Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6053111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method |
scientific article; zbMATH DE number 6053111 |
Statements
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (English)
0 references
4 July 2012
0 references
interpolation
0 references
non-special divisors
0 references
algebraic curves
0 references
finite fields
0 references
tensor rank
0 references
multiplication algorithm
0 references
0 references
0 references
0 references
0.8786006
0 references
0.8747245
0 references
0.8692993
0 references
0.86907697
0 references
0.86339915
0 references
0.86183494
0 references
A new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves given in the article. This approach has three independent key ingredients. I. Asymmetry in the interpolation procedure allowed. II. An alternative proof for the existence of auxiliary divisors, which is constructive, and works also in the symmetric case, although it requires the curves to have sufficiently many points given. III. The method to deal not only with extensions of finite field, but more generally with monogeneous algebras over finite fields allowed.NEWLINENEWLINEThe bibliography contains 38 sources.
0 references
