no code implementations • 5 May 2020 • Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Once we know that $\alpha$ is normal, we show how to perform conversions between the power basis of $\mathsf{K}/\mathsf{F}$ and the normal basis with the same asymptotic cost.
Symbolic Computation Computational Complexity 12Y05, 12F10, 11y16, 68Q25
no code implementations • 1 Feb 2020 • Mark Giesbrecht, Hui Huang, George Labahn, Eugene Zima
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial.
Symbolic Computation Rings and Algebras
