Name
Abstract | ||
|---|---|---|
In a paper entitled "Variation on Euclid's Algorithm for Plynomials," Calvez et al. has shown that the extended Euclid's algorithm can be partially obtained by the nonextended one; in fact, it can obtain only two of the three unknowns of the Bezout's theorem. This letter goes further and shows that all polynomials given by the extended Euclid's algorithm and all the intermediate values can be obtained directly by the nonextended Euclid's algorithm. Consequently, only remainder computations are used. Avoiding multiplications and divisions of polynomials decreases the computational complexity. This variation of Calvez et al. justifies the title of the present letter. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/LSP.2004.824053 | IEEE Signal Process. Lett. |
Keywords | Field | DocType |
computational complexity,polynomials,Bezout's theorem,Euclid's algorithm,computational complexity,polynomials | Polynomial,Remainder,Algorithm,Sturm's theorem,Mathematics,Computation,Computational complexity theory | Journal |
Volume | Issue | ISSN |
11 | 5 | 1070-9908 |
Citations | PageRank | References |
3 | 0.55 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Goupil | 1 | 3 | 0.55 |
| J. Palicot | 2 | 81 | 12.39 |