Article citationsMore>>

B. Beckermann and G. Labahn, “A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relative Prime Numerical Polynomials,” IEEE Journal of Symbolic Computation, Vol. 26, No. 6, 1998, pp. 691-714. http://dx.doi.org/10.1006/jsco.1998.0235

has been cited by the following article:

Follow SCIRP
Twitter Facebook Linkedin Weibo
Contact us
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat
Free SCIRP Newsletters
Copyright © 2006-2021 Scientific Research Publishing Inc. All Rights Reserved.
Top