| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10325740 | Journal of Symbolic Computation | 2005 | 14 Pages |
Abstract
In this paper we present a generic algorithm for factoring polynomials over global fields F. As efficient implementations of that algorithm for number fields and function fields differ substantially, these cases will be treated separately. Complexity issues and implementations will be discussed in part II which also contains illustrative examples.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Michael E. Pohst,