Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials

Author： Akritas A.   Strzeboński A.   Vigklas P.  

Publisher： Springer Publishing Company

ISSN： 0010-485X

Source： Computing, Vol.78, Iss.4, 2006-12, pp. : 355-367

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

Related content

Design and implementations of Ninf: towards a global computing infrastructure

By Nakada H.   Sato M.   Sekiguchi S.  

Future Generation Computer Systems, Vol. 15, Iss. 5, 1999-10 ,pp. : 649-658

Elsevier

Access to resources Recommend Favorite

Ordinal recursive bounds for Higman's theorem

By Cichon E.A.   Bittar E.T.  

Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. : 63-84

Elsevier

Access to resources Recommend Favorite

Computing the Isolated Roots by Matrix Methods

By Mourrain B.  

Journal of Symbolic Computation, Vol. 26, Iss. 6, 1998-12 ,pp. : 715-738

Academic Press

Access to resources Recommend Favorite

An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials

By Fortune S.  

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 627-646

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