An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field.

Lars Langemyr An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field. 222-233 1990 conf/aaecc/1990 AAECC db/conf/aaecc/aaecc1990.html#Langemyr90 http://dx.doi.org/10.1007/3-540-54195-0_53