On a method for finding the roots of an ideal

ISSN： 0361-7688

Source： Programming and Computer Software, Vol.31, Iss.2, 2005-03, pp. : 97-102

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

On finding primitive roots in finite fields

By Shparlinski I.

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 273-275

Elsevier

Access to resources Recommend Favorite

Parallel algorithms for finding polynomial Roots on OTIS-torus

By Lucas Keny Jana Prasanta

The Journal of Supercomputing, Vol. 54, Iss. 2, 2010-11 ,pp. : 139-153

Springer Publishing Company

Access to resources Recommend Favorite

A constructive algorithm for finding the exact roots of polynomials with computable real coefficients

By Lester D. Chambers S. Lu H.L.

Theoretical Computer Science, Vol. 279, Iss. 1, 2002-05 ,pp. : 51-64

Elsevier

Access to resources Recommend Favorite

Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method

By Saha Mitul Latombe Jean-Claude Chang Yu-Chi Prinz Friedrich

Autonomous Robots, Vol. 19, Iss. 3, 2005-12 ,pp. : 301-319

Springer Publishing Company

Access to resources Recommend Favorite

A Symbolic-Numerical Method for Finding a Real Solution of an Arbitrary System of Nonlinear Algebraic Equations

By Tran Q-N.

Journal of Symbolic Computation, Vol. 26, Iss. 6, 1998-12 ,pp. : 739-760

Academic Press

Access to resources Recommend Favorite