158
Voted
ISSAC
15 years 7 months ago
2009 Springer  100
click to vote
ISSAC
15 years 7 months ago
2009 Springer 
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
101
Voted
ISSAC
15 years 7 months ago
2009 Springer 
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
77
Voted
ISSAC
15 years 7 months ago
2009 Springer  |
Mathematics