Searching for "A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials." – 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.

A modular algorithm for computing greatest common right divisors of ore polynomials
by Ziming Li, István Nemes — 1997 — In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation
… presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore…
Cited by 9 (1 self) – Add To MetaCart

Showing 1 through 1.

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