On Approximate GCDs of Univariate Polynomials

By Karmarkar N.K.   Lakshman Y.N.  

Journal of Symbolic Computation, Vol. 26, Iss. 6, 1998-12 ,pp. : 653-666

Academic Press

Access to resources Recommend Favorite

A constructive algorithm for finding the exact roots of polynomials with computable real coefficients

By Lester D.   Chambers S.   Lu H.L.  

Theoretical Computer Science, Vol. 279, Iss. 1, 2002-05 ,pp. : 51-64

Elsevier

Access to resources Recommend Favorite

Improved Techniques for Factoring Univariate Polynomials

By Collins G.E.   Encarnacion M.J.  

Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. : 313-327

Academic Press

Access to resources Recommend Favorite

Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding

By Pan V.Y.  

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 701-733

Academic Press

Access to resources Recommend Favorite

Algorithms for Modular Counting of Roots of Multivariate Polynomials

By Gopalan Parikshit   Guruswami Venkatesan   Lipton Richard  

Algorithmica, Vol. 50, Iss. 4, 2008-04 ,pp. : 479-496

Springer Publishing Company

Access to resources Recommend Favorite