Founded in 1997, BookFinder.com has become a leading book price comparison site:
Find and compare hundreds of millions of new books, used books, rare books and out of print books from over 100,000 booksellers and 60+ websites worldwide.
This textbook gives a well-balanced presentation of the classic procedures of polynomial algebra which are computationally relevant and some algorithms developed during the last decade. The first chapter discusses the construction and the representation of polynomials. The second chapter focuses on the computational aspects of the analytical theory of polynomials. Polynomials with coefficients in a finite field are then described in chapter three, and the final chapetr is devoted to factorization of polynomials with integral coefficients. The book is primarily aimed at graduate students taking courses in Polynomial Algebra, with a prerequisite knowledge of set theory, usual fields and basic algebra. Fully worked out examples, hints and references complement the main text, and details concerning the implementation of algorithms as well as indicators of their efficiency are provided. The book is also useful as a supplementary text for courses in scientific computing, analysis of algorithms, computational polynomial factorization, and computational geometry of polynomials. [via]