International Symposium on Symbolic and Algebraic Manipulation

EUROSAM 1979: Symbolic and Algebraic Computation pp 227-239 | Cite as

Non-modular computation of polynomial GCDS using trial division

  • Anthony C. Hearn
6. Polynomial Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 72)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    BROWN, W.S, The Subresultant PRS Algorithm, TOMS 4 (1978) 237–249Google Scholar
  2. [2]
    MOSES, J and YUN, D.Y.Y., The EZ GCD Algorithm, Proceedings of ACM 73 (1973) 159–166Google Scholar
  3. [3]
    BROWN, W.S., On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journ A.C.M. 18 (1971) 478–504Google Scholar
  4. [4]
    COLLINS, G.E., Subresultants and reduced polynomial remainder sequences, Journ A.C.M. 14 (1967) 128–142Google Scholar
  5. [5]
    HEARN, A.C., An Improved Non-modular Polynomial GCD Algorithm, SIGSAM Bulletin, ACM 23, New York, (1972) 10–15Google Scholar
  6. [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–133Google Scholar
  7. [7]
    HEARN, A.C., A Mode Analyzing Algebraic Manipulation Program, Proceedings of ACM 74, ACM, New York (1974) 722–724Google Scholar
  8. [8]
    GRISS, M.L., The Definition and Use of Data-Structures in REDUCE, Proc. SYMSAC 76, ACM, New York (1976) 53–59Google Scholar
  9. [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

Copyright information

© Springer-Verlag 1979

Authors and Affiliations

  • Anthony C. Hearn
    • 1
  1. 1.Department of Computer ScienceUniversity of UtahSalt Lake CityU.S.A.

Personalised recommendations