Does anyone know what are the most efficient algorithms for factoring polynomials in a field of characteristic zero, i.e, a field that may contain infinitely many elements. I'm mainly concerned within the context of the field of integers but I wouldn't mind the rationals as well.
closed as unclear what you're asking by D.W.♦, FrankW, David Richerby, Juho, Guy Coder Jul 18 '14 at 14:05
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
Do you know of Berlekamp's algorithm and the Cantor–Zassenhaus algorithm?
Unless I'm misunderstanding your question, there is no field of integers- they form a ring but don't have multiplicative inverses