COMPUTER ALGEBRA OF POLYNOMIALS AND RATIONAL FUNCTIONS

[1] BERLEKAM.ER, 1967, AT&T TECH J, V46, P1853

[2] Berlekamp E. R., 1968, ALGEBRAIC CODING THE

[3] FACTORING POLYNOMIALS OVER LARGE FINITE FIELDS [J]. MATHEMATICS OF COMPUTATION, 1970, 24 (111) : 713 - +

[4] EUCLIDS ALGORITHM AND COMPUTATION OF POLYNOMIAL GREATEST COMMON DIVISORS [J]. JOURNAL OF THE ACM, 1971, 18 (04) : 478 - &

[5] BROWN WS, 1972, ALTRAN USERS MANUAL

[6] BROWN WS, 1971, J ASSOC COMPUT MACH, V18, P515

[7] ON CANONICAL FORMS AND SIMPLIFICATION [J]. JOURNAL OF THE ACM, 1970, 17 (02) : 385 - &

[8] CAVINESS BF, 1972, 1972 SIAM SIGNUM FAL

[9] SUBRESULTANTS AND REDUCED POLYNOMIAL REMAINDER SEQUENCES [J]. JOURNAL OF THE ACM, 1967, 14 (01) : 128 - &

[10] A METHOD FOR OVERLAPPING AND ERASURE OF LISTS [J]. COMMUNICATIONS OF THE ACM, 1960, 3 (12) : 655 - 657

[1] BERLEKAM.ER, 1967, AT&T TECH J, V46, P1853

[2] Berlekamp E. R., 1968, ALGEBRAIC CODING THE

[3] FACTORING POLYNOMIALS OVER LARGE FINITE FIELDS [J]. MATHEMATICS OF COMPUTATION, 1970, 24 (111) : 713 - +

[4] EUCLIDS ALGORITHM AND COMPUTATION OF POLYNOMIAL GREATEST COMMON DIVISORS [J]. JOURNAL OF THE ACM, 1971, 18 (04) : 478 - &

[5] BROWN WS, 1972, ALTRAN USERS MANUAL

[6] BROWN WS, 1971, J ASSOC COMPUT MACH, V18, P515

[7] ON CANONICAL FORMS AND SIMPLIFICATION [J]. JOURNAL OF THE ACM, 1970, 17 (02) : 385 - &

[8] CAVINESS BF, 1972, 1972 SIAM SIGNUM FAL

[9] SUBRESULTANTS AND REDUCED POLYNOMIAL REMAINDER SEQUENCES [J]. JOURNAL OF THE ACM, 1967, 14 (01) : 128 - &

[10] A METHOD FOR OVERLAPPING AND ERASURE OF LISTS [J]. COMMUNICATIONS OF THE ACM, 1960, 3 (12) : 655 - 657