Exact polynomial factorization by approximate high degree algebraic numbers
Jingwei Chen, Yong Feng, Xiaolin Qin, Jingzhong Zhang · 2009
For factoring polynomials in two variables with rational coefficients, an algorithm using transcendental evaluation was presented by Hulst and Lenstra. In their algorithm, transcendence measure was computed. However, a constant c is necessary to compute the transcendence measure. The size of c involved the transcendence measure can influence the efficiency of the algorithm greatly.