30 citations · 70 across the 24 of their papers we have counts for
Showing 2019 · cs.SCShow all
3 papers · 2 filters
cs.SC2019
Counting invariant subspaces and decompositions of additive polynomials
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f…
cs.SC2019
Efficient Rational Creative Telescoping
Mark Giesbrecht, Hui Huang, George Labahn +1
We present a new algorithm to compute minimal telescopers for rational functions in two discrete variables. As with recent reduction-based approaches, our algorithm has the importa…
cs.SC2019
Quadratic Probabilistic Algorithms for Normal Bases
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
It is well known that for any finite Galois extension field , with Galois group , there exists an element whose orbit forms an -ba…