Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Factorization of Polynomials

Numerical Algorithm

Factorization of polynomials, or polynomial factorization, expresses a polynomial with coefficients in a given field or in the integers as a product of irreducible factors with coefficients in the same domain. It is a fundamental component of computer algebra systems, and the earliest algorithms for the task are traced to the mathematician Theodor von Schubert in 1793. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Sources
Wikipedia: Factorization of polynomials
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.