Factoring Polynomials Over Algebraic Number Fields
ACM Transactions on Mathematical Software (TOMS)
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Factoring univariate integral polynomial in polynomial average time
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Algebraic factoring and rational function integration
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Implementing a polynomial factorization and GCD package
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Algorithms for polynomial factorization.
Algorithms for polynomial factorization.
Factoring rational polynomials over the complexes
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Symbolic parametrization of pipe and canal surfaces
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Proper parametrization of surfaces with a rational pencil
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
The calculation of radical ideals in positive characteristic
Journal of Symbolic Computation
| Hi-index | 0.00 |
This paper considers the problem of factoring polynomials over a variety of domains. We first describe the current methods of factoring polynomials over the integers, and extend them to the integers mod p. We then consider the problem of factoring over algebraic domains. Having produced several negative results, showing that, if the domain is not properly specified, then the problem is insoluble, we then show that, for a properly specified finitely generated extension of the rationals or the integers mod p, the problem is soluble. We conclude by discussing the problems of factoring over algebraic closures.