Author： Heam P.-C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 735-741
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
The complexity of the characteristic and the minimal polynomial
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
Access to resources
Recommend
Derivatives of rational expressions and related theorems
By Champarnaud J.-M. Duchamp G.
Theoretical Computer Science, Vol. 313, Iss. 1, 2004-02 ,pp. :
On the cell probe complexity of polynomial evaluation
Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. :
Polynomial/Rational Approximation of Minkowski Sum Boundary Curves
By Lee I.-K. Kim M.-S. Elber G.
Graphical Models and Image Processing, Vol. 60, Iss. 2, 1998-03 ,pp. :
Complexity results for triangular sets
By Schost E.
Journal of Symbolic Computation, Vol. 36, Iss. 3, 2003-09 ,pp. :