1993 | OriginalPaper | Buchkapitel
Polynomial GCD’s Classical Algorithms
verfasst von : Richard Zippel
Erschienen in: Effective Polynomial Computation
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The computation of polynomial greatest common divisors is required more frequently than one might at first imagine. For instance, nearly all computations with rational functions (quotients of polynomials) require a GCD to reduce the fraction to lowest terms. However, computing polynomial GCD’s is significantly more difficult than the arithmetic calculations discussed in Chapter 7.