Heuristic methods for operations with algebraic numbers | SpringerLink
Skip to main content
Springer Nature Link
Log in

Heuristic methods for operations with algebraic numbers

  • Arithmetic
  • Conference paper
  • First Online:
Symbolic and Algebraic Computation (ISSAC 1988)

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

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.

6. References

  1. J.A. Abbott, R.J. Bradford, and J.H. Davenport, “The Bath Algebraic Number Package,” Bath Computer Science Technical Report No. 2, University of Bath, (1986).

    Google Scholar 

  2. B.W. Char, K.O. Geddes, G.H. Gonnet, and S.M. Watt, Maple User's Guide, WATCOM (1985).

    Google Scholar 

  3. B.W. Char, K.O. Geddes, and G.H. Gonnet, “GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation,” Journal of Symbolic Computation, (1988 (to appear)).

    Google Scholar 

  4. D. Duval, “Cacul Formel Avec des Nombres Algébriques,” Docotral Thesis, University of Grenoble, (1987).

    Google Scholar 

  5. D.E. Knuth, The Art of Computer Programming, Vol II, Seminumerical Algorithms, Addison Wesley (1981).

    Google Scholar 

  6. L. Kronecker, “Grundzüge einer arithmetischen Theorie der algebraischen Grössen,” Journal für reine und angewandte Mathematik, 92 pp. 1–122 (1882).

    Google Scholar 

  7. S. Landau, “Factoring Polynomials Over Algebraic Number Fields,” SIAM Journal of Computing, 14:1 pp. 184–195 Society for Industrial and Applied Mathematics, (1985).

    Google Scholar 

  8. L. Langemyr and S McCallum, The Computation of Polynomial Greatest Common Divisors Over an Algebraic Number Field.

    Google Scholar 

  9. R. Loos, “Computing in Algebraic Extensions,” Computing Suppl., 4 pp. 173–187 Springer, (1982).

    Google Scholar 

  10. M.B. Monagan, Private Communication, (1988).

    Google Scholar 

  11. T.J. Smedley, “Symbolic Computation with Algebraic Numbers and Functions,” Research Report CS-87-29, University of Waterloo, (May 1987). Master's Thesis

    Google Scholar 

  12. B.L. van der Waerden, Modern Algebra, Frederick Ungar (1941).

    Google Scholar 

  13. P.J. Weinberger and L.P. Rothschild, “Factoring Polynomials Over Algebraic Number Fields,” ACM Transactions on Mathematical Software, 2 pp. 335–350 Association for Computing Machinery, (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, CANADA

    Keith O. Geddes, Gaston H. Gonnet & Trevor J. Smedley

Authors
  1. Keith O. Geddes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gaston H. Gonnet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Trevor J. Smedley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Gianni

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geddes, K.O., Gonnet, G.H., Smedley, T.J. (1989). Heuristic methods for operations with algebraic numbers. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-51084-2_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51084-0

  • Online ISBN: 978-3-540-46153-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation