Khungurn P, Sekigawa H and Shirayanagi K. Minimum converging precision of the QR-factorization algorithm for real polynomial GCD. Proceedings of the 2007 international symposium on Symbolic and algebraic computation. (227-234).
Langemyr L.
(1991). An asymptotically fast probabilistic algorithm for computing polynomial GCD's over an algebraic number field. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. 10.1007/3-540-54195-0_53. (222-233).