Review of Polynomial and Matrix Computations; Volume 1: Fundamental Algorithms by Dario Bini and Victor Pan.

UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
Stephen R. Tate, Professor and Department Head (Creator)
The University of North Carolina at Greensboro (UNCG )
Web Site:

Abstract: The past few decades have produced a wealth of interesting and useful work in the area of algorithms for algebraic, symbolic, and numerical computing. Unfortunately, there has been a huge void in the area of books summarizing and bringing together the core results of algebraic computation, with the two main exceptions being Borodin and Munro's excellent book The Computational Complexity of Algebraic and Numeric Problems (published in 1975), and selected chapters of the oft-cited algorithms book by Aho, Hoperoft, and Ullman (published in 1974). Both of these books are now over two decades old and cover fairly small sets of selected topics.

Additional Information

SIGACT News, Vol. 26, No. 2, June 1995.
Language: English
Date: 1995
Book review, Mathematics, Computer science, Algebraic, Symbolic, Numerical

Email this document to