Polynomials with Integer Coefficients

Maurice Mignotte
Additional contact information
Maurice Mignotte: Université Louis Pasteur, Départment de Mathématique

Chapter Chapter 7 in Mathematics for Computer Algebra, 1992, pp 289-322 from Springer

Abstract: Abstract This chapter is the culmination of this book. Here we describe algorithms of factorization of polynomials with integer coefficients. These algorithms use many of the results demonstrated in the previous chapters.

Keywords: Prime Number; Previous Chapter; Chinese Remainder Theorem; Irreducible Factor; Integer Coefficient (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-9171-5_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461391715

DOI: 10.1007/978-1-4613-9171-5_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().