Name
Abstract | ||
|---|---|---|
We describe a probabilistic algorithm for the computation of the gcd of two univariate integer polynomials of degrees ≤ n with their l1-norms being bounded by 2h and estimate its expected running time by a worst-case bound of O(n(n + h)1 + o(1)) bit operations. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1016/0196-6774(88)90027-2 | J. Algorithms |
Keywords | Field | DocType |
integer polynomial gcds,probabilistic computation | Integer,Randomized algorithm,Discrete mathematics,Combinatorics,Algorithmics,Polynomial,Probabilistic logic,Univariate,Mathematics,Bounded function,Computation | Journal |
Volume | Issue | ISSN |
9 | 3 | 0196-6774 |
Citations | PageRank | References |
6 | 1.20 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Schönhage | 1 | 6 | 1.20 |