Factorization of polynomials by transcendental evaluation

A new polynomial-time algorithm for the factorization of polynomials in two variables with rational coefficients is presented. The algorithm works by replacing one of the variables by an approximation of a transcendental number. It generalizes recent results by Kannan, Lenstra, Lovasz and Schonhage. Asymptotically the algorithm improves on the running times of previously published methods


Published in:
EUROCAL '85. European Conference on Computer Algebra, 138 - 45
Presented at:
EUROCAL '85. European Conference on Computer Algebra, Berlin, West Germany
Year:
1985
Keywords:
Laboratories:




 Record created 2010-06-24, last modified 2018-01-28

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)