Polynomial Algorithms in Computer Algebra
Our rough guess is there are 67,500 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 30 minutes to read. With a half hour per day, this will take 9 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
67,500 words, Guess
Page Count
270 pages
Physical Format
Electronic resource
Identifiers
- Internet Archivepolynomialalgori00wink
- ISBN-103709165717
- ISBN-139783709165713
- OCLC Control Number840302733
- Better World Books9783709165713
and 1 more
- Open LibraryOL27081819M
Classifications
- LCCQA1-939
Description
The book gives a thorough introduction to the mathematical underpinnings of computer algebra. The subjects treated range from arithmetic of integers and polynomials to fast factorization methods, Gröbner bases, and algorithms in algebraic geometry. The algebraic background for all the algorithms presented in the book is fully described, and most of the algorithms are investigated with respect to their computational complexity. Each chapter closes with a brief survey of the related literature.
Subjects
Series Statement
- Texts and Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes-Kepler-University, Linz, Austria, 0943-853X
- Texts and Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes-Kepler-University, Linz, Austria
Links
Other Editions
- Polynomial Algorithms in Computer Algebra
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!