The complexity of the characteristic and the minimal polynomial

Author： Hoang T.M.   Thierauf T.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.295, Iss.1, 2003-02, pp. : 205-222

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Characteristic Sets for Polynomial Grammatical Inference

By de la Higuera C.  

Machine Learning, Vol. 27, Iss. 2, 1997-05 ,pp. : 125-138

Springer Publishing Company

Access to resources Recommend Favorite

On the cell probe complexity of polynomial evaluation

By Miltersen P.B.  

Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. : 167-174

Elsevier

Access to resources Recommend Favorite

Some complexity results for polynomial rational expressions

By Heam P.-C.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 735-741

Elsevier

Access to resources Recommend Favorite

Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero-Characteristic

By Chistov A.L.  

Journal of Symbolic Computation, Vol. 22, Iss. 1, 1996-01 ,pp. : 1-25

Academic Press

Access to resources Recommend Favorite

Derivations and Radicals of Polynomial Ideals over Fields of Arbitrary Characteristic

By Fortuna E.   Gianni P.   Trager B.  

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 609-625

Academic Press

Access to resources Recommend Favorite