메뉴 건너뛰기




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)
  • 2
    • 84976860897 scopus 로고    scopus 로고
    • Symbol manipulation Aug.
    • Sammet J. E., et al. Symbol manipulation. Comm. ACM 9 (Aug. 68), 547-643.
    • Comm. ACM , vol.9 , pp. 547-643
    • Sammet, J.E.1
  • 3
    • 0013367203 scopus 로고
    • Bigradients and the problem of Routh and Hurwitz
    • Jan
    • Householder, A. S. Bigradients and the problem of Routh and Hurwitz, SIAM Rev. 10 (Jan. 1968), 56-66.
    • (1968) SIAM Rev. , vol.10 , pp. 56-66
    • Householder, A.S.1
  • 4
    • 84947358719 scopus 로고
    • Bigradients, Hankel determinants, and the Padé table. B. Dejon and P. Henrici, Eds. Wiley-Interscience, New York
    • Householder, A. S., and Stewart, G. W., III. Bigradients, Hankel determinants, and the Padé table. In Constructive Aspects of the Fundamental Theorem of Algebra, B. Dejon and P. Henrici, Eds. Wiley-Interscience, New York, 1969, pp. 131-150.
    • (1969) Constructive Aspects of the Fundamental Theorem of Algebra , pp. 131-150
    • Householder, A.S.1    Stewart, G.W.2
  • 7
    • 84945709818 scopus 로고
    • Subresultants and reduced polynomial remainder sequences
    • Jan.
    • Collins, G. E. Subresultants and reduced polynomial remainder sequences. J. ACM 14 (Jan. 1967), 128-142.
    • (1967) J. ACM , vol.14 , pp. 128-142
    • Collins, G.E.1
  • 8
    • 0015141743 scopus 로고
    • On Euclid's algorithm and the theory of subresultants
    • Oct
    • Brown W. S., and Traub, J. F. On Euclid's algorithm and the theory of subresultants.J. ACM 18 (Oct. 1971), 505-514.
    • (1971) J. ACM , vol.18 , pp. 505-514
    • Brown, W.S.1    Traub, J.F.2
  • 11
    • 0015145497 scopus 로고
    • Oct.
    • J. ACM 18 (Oct. 1971), 515-532.
    • (1971) J. ACM , vol.18 , pp. 515-532


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.