Author： Diaz-Toca G.M. Gonzalez-Vega L.
Publisher： Academic Press
ISSN： 0747-7171
Source： Journal of Symbolic Computation, Vol.34, Iss.1, 2002-07, pp. : 59-81
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On primitive recursive algorithms and the greatest common divisor function
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Access to resources
Recommend
Multidimensional -automata, -polynomials and generalised S-matrices
Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. :
On Approximate GCDs of Univariate Polynomials
By Karmarkar N.K. Lakshman Y.N.
Journal of Symbolic Computation, Vol. 26, Iss. 6, 1998-12 ,pp. :
Fast Computation of the Bezout and Dixon Resultant Matrices
By Chionh E-W. Zhang M. Goldman R.N.
Journal of Symbolic Computation, Vol. 33, Iss. 1, 2002-01 ,pp. :
Improved Techniques for Factoring Univariate Polynomials
By Collins G.E. Encarnacion M.J.
Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. :