Polynomial Factorization

K. O. Geddes, S. R. Czapor and G. Labahn
Additional contact information
K. O. Geddes: University of Waterloo
S. R. Czapor: Laurentian University
G. Labahn: University of Waterloo

Chapter Chapter 8 in Algorithms for Computer Algebra, 1992, pp 337-388 from Springer

Abstract: Abstract The problem of factoring polynomials arises in numerous areas in symbolic computation. Indeed, it plays a critical role as a subproblem to many other problems including simplification, symbolic integration and the solution of polynomial equations. Polynomial fac torization also plays a significant role in such diverse fields as algebraic coding theory, cryptography and number theory.

Keywords: Computer Algebra; Minimal Polynomial; Irreducible Polynomial; Irreducible Factor; Multivariate Polynomial (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-0-585-33247-5_8

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

DOI: 10.1007/978-0-585-33247-5_8

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 ().