EUCLIDS ALGORITHM AND COMPUTATION OF POLYNOMIAL GREATEST COMMON DIVISORS

被引：120

作者：

BROWN, WS

机构：

来源：

关键词：

D O I：

10.1145/321662.321664

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：478 / &

共 14 条

[1]

BIRKHOFF G, 1965, SURVEY MODERN ALGEBR

[2] EUCLIDS ALGORITHM AND THEORY OF SUBRESULTANTS [J].

BROWN, WS ;

TRAUB, JF .

[3] SUBRESULTANTS AND REDUCED POLYNOMIAL REMAINDER SEQUENCES [J].

COLLINS, GE .

[4] CALCULATION OF MULTIVARIATE POLYNOMIAL RESULTANTS [J].

COLLINS, GE .

[5]

COLLINS GE, 1971, 2 P S SYM ALG MAN, P212

[6]

Erd~elyi A., 1956, ASYMPTOTIC EXPANSION

[7]

GOLDSTEIN AJ, TO BE PUBLISHED

[8]

Householder A. S., 1969, Constructive aspects of the fundamental theorem of algebra, P131

[9] BIGRADIENTS AND PROBLEM OF ROUTH AND HURWITZ [J].

HOUSEHOLDER, AS .

[10]

Knuth D. E., 1969, ART COMPUTER PROGRAM, V2