Factoring polynomials over global fields. II.
From MaRDI portal
Publication:2456609
DOI10.1016/J.JSC.2005.03.003zbMath1156.11347OpenAlexW4213115949MaRDI QIDQ2456609
José Méndez Omaña, Michael E. Pohst
Publication date: 19 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2005.03.003
Number-theoretic algorithms; complexity (11Y16) Polynomials in real and complex fields: factorization (12D05) Algebraic number theory computations (11Y40)
Related Items (4)
A lifting and recombination algorithm for rational factorization of sparse polynomials ⋮ Factorization and root-finding for polynomials over division quaternion algebras ⋮ On solving norm equations in global function fields ⋮ Factoring polynomials over global fields
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials and the knapsack problem
- Factoring multivariate polynomials over finite fields
- Factoring polynomials with rational coefficients
- Construction and estimation of bases in function fields
- KANT V4
- Factoring polynomials over global fields. I
- A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
This page was built for publication: Factoring polynomials over global fields. II.