Login / Signup
A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials.
Bernhard Beckermann
George Labahn
Published in:
J. Symb. Comput. (1998)
Keyphrases
</>
numerically stable
learning algorithm
objective function
dynamic programming
computationally efficient
expectation maximization
semidefinite programming
similarity measure
np hard
input data
convex hull