- 354 Downloads
Modular algorithms are successfully employed in various areas of computer algebra, e.g., for factoring or computing greatest common divisors of polynomials or for solving systems of linear equations. They control the well-known phenomenon of intermediate expression swell, delay rational arithmetic until the very last step of the computation, and are often asymptotically faster than their non-modular counterparts.
Unable to display preview. Download preview PDF.