Algorithms and Bounds for Resultants
Stephen Tse, SFU
We have created a complete collection of algorithms and bounds for the computation of resultants over number fields and finite fields. The main contributions are multivariate modular algorithms over large and very small fields, probabilistic degree bounds, and a denominator multiple. In the talk I will demonstrate the implementation running in Maple and go through some examples.