Skip to main content

Introduction

  • Chapter
Computer Algebra

Part of the book series: Computing Supplementum ((COMPUTING,volume 4))

Abstract

In this introduction we first give a working definition of computer algebra. We then describe the organization of research activities in this field. Finally the overall structure and the intention of the present volume on computer algebra is explained. Some technical information (basic references, notation etc.) about the volume is given.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A. U., Hoperoft, J. E., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Reading, Mass.: Addison-Wesley 1974.

    MATH  Google Scholar 

  2. Birkhoff, G.: The Role of Modern Algebra in Computing. SIAM Proc. 1971, 1–47.

    Google Scholar 

  3. Birkhoff, G.: Current Trends in Algebra. Am. Math. Mon. 80/7, 760–762 (1973).

    Article  MathSciNet  MATH  Google Scholar 

  4. Birkhoff, G., Lipson, J.: Heterogeneous Algebra. J. Comb. Theory 8, 115–133 (1970).

    Article  MathSciNet  MATH  Google Scholar 

  5. Borodin, A. B., Munro, I.: The Computational Complexity of Algebraic and Numeric Problems. New York: American Elsevier 1975.

    MATH  Google Scholar 

  6. Brainerd, W. S., Landweber, L. H.: Theory of Computation. New York: J. Wiley 1974.

    Google Scholar 

  7. Buchberger, B., Lichtenberger, F.: Mathematik für Informatiker I (Die Methoden der Mathematik), 2nd ed. Berlin-Heidelberg-New York: Springer 1981.

    Book  Google Scholar 

  8. Collins, G. E.: Computer Algebra of Polynomials and Rational Functions. Am. Math. Mon. 80/7, 725–755 (1973).

    Article  MATH  Google Scholar 

  9. Griesmer, J. H.: The State of Symbolic Computation. SIGSAM Bull. 13/3, 25–28 (1979).

    Article  Google Scholar 

  10. Hasse, H.: Höhere Algebra I. Berlin: De Gruyter 1957.

    Google Scholar 

  11. Hermann, G.: Die Frage der endlich vielen Schritte in der Theorie der Polynomideale. Math. Ann. 95, 736–788 (1926).

    Article  MathSciNet  MATH  Google Scholar 

  12. Knuth, D. E.: The Art of Computer Programming, Vol. I–III. Reading, Mass.: 1968–1981.

    Google Scholar 

  13. Knuth, D. E.: Algorithms. Scientific American 236/4, 63 –80 (1977).

    Article  MathSciNet  Google Scholar 

  14. Kronecker, L.: Werke (Hensel, K., ed.). Leipzig: 1845.

    Google Scholar 

  15. Lipson, J. D.: Algebra and Algebraic Computing. London: Addison-Wesley 1981.

    MATH  Google Scholar 

  16. van der Waerden, B. L.: Modern Algebra, Vol. I and II. New York: Frederick Ungar 1953.

    Google Scholar 

  17. Weyl, H.: Randbemerkungen zu Hauptproblemen der Mathematik II: Fundamentalsatz der Algebra und Grundlagen der Mathematik. Math. Z. 20, 131–150 (1924).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Wien

About this chapter

Cite this chapter

Loos, R. (1982). Introduction. In: Buchberger, B., Collins, G.E., Loos, R. (eds) Computer Algebra. Computing Supplementum, vol 4. Springer, Vienna. https://doi.org/10.1007/978-3-7091-3406-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-3406-1_1

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81684-4

  • Online ISBN: 978-3-7091-3406-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics