Univariate polynomial factorization over finite fields

By Naudin P.   Quitte C.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 1-36

Elsevier

Access to resources Recommend Favorite

On some approximation problems concerning sparse polynomials over finite fields

By Karpinski M.   Shparlinski I.  

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 259-266

Elsevier

Access to resources Recommend Favorite

On factorization forests of finite height

By Chalopin J.   Leung H.  

Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. : 489-499

Elsevier

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