Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
4. Factoring polynomials
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
Abstract
In this first section of the chapter we consider a classical method, due to Kronecker, for factoring an integer polynomial. We should mention at the outset that the interest of the method does not lie in its applicability (it is not really efficient, even for polynomials of degree as low as five) but rather in its existence. Indeed, it affords an algorithm that in finitely many steps allows one to establish whether a polynomial is reducible or not, and if the answer is in the positive it yields the factorisation into irreducible factors. In other words, it allows one to state that the problem of factoring an integer polynomial is decidable.