Non-modular computation of polynomial GCDS using trial division

1. BROWN, W.S, The Subresultant PRS Algorithm, TOMS 4 (1978) 237–249

   Google Scholar 

2. MOSES, J and YUN, D.Y.Y., The EZ GCD Algorithm, Proceedings of ACM 73 (1973) 159–166

   Google Scholar 

3. BROWN, W.S., On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journ A.C.M. 18 (1971) 478–504

   Google Scholar 

4. COLLINS, G.E., Subresultants and reduced polynomial remainder sequences, Journ A.C.M. 14 (1967) 128–142

   Google Scholar 

5. HEARN, A.C., An Improved Non-modular Polynomial GCD Algorithm, SIGSAM Bulletin, ACM 23, New York, (1972) 10–15

   Google Scholar 

6. HEARN, A.C., REDUCE 2 — A System and Language for Algebraic Manipulation, Proc. of Second Symposium on Symbolic and Algebraic Manipulation, International Hotel, Los Angeles (1971) 128–133

   Google Scholar 

7. HEARN, A.C., A Mode Analyzing Algebraic Manipulation Program, Proceedings of ACM 74, ACM, New York (1974) 722–724

   Google Scholar 

8. GRISS, M.L., The Definition and Use of Data-Structures in REDUCE, Proc. SYMSAC 76, ACM, New York (1976) 53–59

   Google Scholar 

9. HEARN, A.C., The Structure of Algebraic Computations, Proc. of the Fourth Colloquium on Advanced Comp. Methods in Theor. Physics, St. Maximin, France, (1977) 1–15.

   Google Scholar 

Download references