multiplication algorithmWe give 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. Our approach features three independent key ingredients. We allow asymmetry in...
Chudnovsky algorithmIn this paper, we calculate the coefficients in two of Ramanujan's series for \\(1/\\pi \\) and those in the Chudnovskys' series. For our calculation, we don't require special software packages, but only the Fourier expansions of the Eisenstein series with a precision ...