Skip to main content
SpringerLink
Log in

Non-modular computation of polynomial GCDS using trial division

  • 6. Polynomial Algorithms
  • Conference paper
  • First Online:
Symbolic and Algebraic Computation (EUROSAM 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 72))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Utah, Salt Lake City, Utah, U.S.A.

    Anthony C. Hearn

Authors
  1. Anthony C. Hearn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edward W. Ng

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hearn, A.C. (1979). Non-modular computation of polynomial GCDS using trial division. In: Ng, E.W. (eds) Symbolic and Algebraic Computation. EUROSAM 1979. Lecture Notes in Computer Science, vol 72. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09519-5_74

Download citation

  • DOI: https://doi.org/10.1007/3-540-09519-5_74

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09519-4

  • Online ISBN: 978-3-540-35128-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation