0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Algebra

Buy Now

Effective Polynomial Computation (Hardcover, 1993 ed.) Loot Price: R4,753
Discovery Miles 47 530
Effective Polynomial Computation (Hardcover, 1993 ed.): Richard Zippel

Effective Polynomial Computation (Hardcover, 1993 ed.)

Richard Zippel

Series: The Springer International Series in Engineering and Computer Science, 241

 (sign in to rate)
Loot Price R4,753 Discovery Miles 47 530 | Repayment Terms: R445 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It discusses the basic algorithms for manipulating polynomials including factoring polynomials. These algorithms are discussed from both a theoretical and practical perspective. Those cases where theoretically optimal algorithms are inappropriate are discussed and the practical alternatives are explained. Effective Polynomial Computation provides much of the mathematical motivation of the algorithms discussed to help the reader appreciate the mathematical mechanisms underlying the algorithms, and so that the algorithms will not appear to be constructed out of whole cloth. Preparatory to the discussion of algorithms for polynomials, the first third of this book discusses related issues in elementary number theory. These results are either used in later algorithms (e.g. the discussion of lattices and Diophantine approximation), or analogs of the number theoretic algorithms are used for polynomial problems (e.g. Euclidean algorithm and p-adic numbers). Among the unique features of Effective Polynomial Computation is the detailed material on greatest common divisor and factoring algorithms for sparse multivariate polynomials. In addition, both deterministic and probabilistic algorithms for irreducibility testing of polynomials are discussed.

General

Imprint: Springer
Country of origin: Netherlands
Series: The Springer International Series in Engineering and Computer Science, 241
Release date: July 1993
First published: 1993
Authors: Richard Zippel
Dimensions: 235 x 155 x 22mm (L x W x T)
Format: Hardcover
Pages: 363
Edition: 1993 ed.
ISBN-13: 978-0-7923-9375-7
Categories: Books > Science & Mathematics > Mathematics > Algebra > General
Books > Computing & IT > Applications of computing > Image processing > General
Promotions
LSN: 0-7923-9375-9
Barcode: 9780792393757

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Theory of Matrices
B.S. Vatsa, Suchi Vatsa Paperback R940 Discovery Miles 9 400
Introduction to Linear Algebra
Gilbert Strang Hardcover R2,404 Discovery Miles 24 040
Loop Groups
Andrew Pressley, Graeme Segal Hardcover R4,164 Discovery Miles 41 640
Math Without Numbers
Milo Beckman Paperback R474 R437 Discovery Miles 4 370
Introduction to Analysis - Pearson New…
William Wade Paperback R2,465 Discovery Miles 24 650
The Ten Equations That Rule the World…
David Sumpter Paperback R541 R500 Discovery Miles 5 000
Sets, Groups, and Mappings - An…
Andrew D. Hwang Hardcover R2,471 Discovery Miles 24 710
Linear Algebra: Gateway to Mathematics
Robert Messer Paperback R4,521 R2,474 Discovery Miles 24 740
Deformation Theory of Discontinuous…
Ali Baklouti Hardcover R5,878 Discovery Miles 58 780
The Rules of Contagion - Why Things…
Adam Kucharski Paperback R514 R485 Discovery Miles 4 850
Best Books gegradeerde leesreeks: Vlak 1…
Best Books Paperback R90 R85 Discovery Miles 850
The Classification of the Finite Simple…
Inna Capdeboscq, Daniel Gorenstein, … Paperback R2,713 Discovery Miles 27 130

See more

Partners