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/
Connections
In Field
Source Wikipedia: Factorization of polynomials
Uses Design Technique
Source Wikipedia: Factorization of polynomials
Sources
Wikipedia: Factorization of polynomials
Lead section
In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain.
Uses Design Technique: Brute-Force Search, Article body
So, an exhaustive search allows finding all factors of degree at most d.
In Field: Computer Algebra, Lead
In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.