


default search action
"A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting ..."
Bernhard Beckermann, George Labahn (1998)
- Bernhard Beckermann, George Labahn:

A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials. J. Symb. Comput. 26(6): 691-714 (1998)

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID













