Advertisement

1. Introduction

  • Jürgen Gerhard
Chapter
  • 356 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3218)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jürgen Gerhard

    There are no affiliations available

    Personalised recommendations