Searching for "Two Fast GCD Algorithms." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

In-place arithmetic for polynomials over Zn
by Michael Monagan — 1993 — In Proceedings of DISCO '92
… that the computationally intensive steps of the two fast Gcd algorithms compared by Smedley [18] for computing Gcds…
Cited by 6 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB