Author： Miltersen P.B.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.143, Iss.1, 1995-07, pp. : 167-174
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
Some complexity results for polynomial rational expressions
By Heam P.-C.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
Stability of parallel algorithms for polynomial evaluation
Computers and Mathematics with Applications, Vol. 46, Iss. 5, 2003-09 ,pp. :
A new method to obtain lower bounds for polynomial evaluation
By Aldaz
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
The complexity of query evaluation in indefinite temporal constraint databases
Theoretical Computer Science, Vol. 171, Iss. 1, 1997-01 ,pp. :