Overview
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (12 chapters)
Keywords
About this book
Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.
Reviews
Computer Algebra Nederland Newsletter, June 1993
Authors and Affiliations
Bibliographic Information
Book Title: Algorithms for Computer Algebra
Authors: K. O. Geddes, S. R. Czapor, G. Labahn
DOI: https://doi.org/10.1007/b102438
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media New York 1992
Hardcover ISBN: 978-0-7923-9259-0Published: 30 September 1992
Softcover ISBN: 978-1-4757-8323-0Published: 24 March 2013
eBook ISBN: 978-0-585-33247-5Published: 30 June 2007
Edition Number: 1
Number of Pages: XXII, 586
Topics: Mathematical Software, Image Processing and Computer Vision, Algebra, Symbolic and Algebraic Manipulation, Numeric Computing, Computer Science, general