|
Volumn 18, Issue 4, 1971, Pages 478-504
|
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
|
Author keywords
algebra; asymptotic bounds; Chinese remainder algorithm; coefficient growth; computing time analysis; Euclid's algorithm; greatest common divisors; intermediate expression swell; modular arithmetic; modular mappings; polynomial remainder sequences; polynomials; subresultants
|
Indexed keywords
MATHEMATICS;
|
EID: 0015143623
PISSN: 00045411
EISSN: 1557735X
Source Type: Journal
DOI: 10.1145/321662.321664 Document Type: Article |
Times cited : (165)
|
References (13)
|