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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: MB Books, Derbyshire, Reino Unido
Hardcover. Condición: Good. No Jacket. Condition : Good. Ex-university library copy with associated library stamps etc. Hard cover, no jacket. 363pp. No highlighting or annotations. A clean tight copy. Nº de ref. del artículo: 942204
Cantidad disponible: 1 disponibles
Librería: Chequamegon Books, Washburn, WI, Estados Unidos de America
Hardcover. Condición: Near Fine. 363 pages; 6 1/4 x 9 1/2" This is an introduction to the algorithms of computer algebra and discusses the basic algorithms for manipulating polynomials including factoring polynomials. 3 x 3 1/2" previous owner's bookplate on front pastedown. Nº de ref. del artículo: 122339
Cantidad disponible: 1 disponibles
Librería: Zubal-Books, Since 1961, Cleveland, OH, Estados Unidos de America
Condición: New. 374 pp., hardcover, new. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Photos available upon request. Nº de ref. del artículo: ZB1358776
Cantidad disponible: 1 disponibles
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
hardcover. Condición: Acceptable. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority! Nº de ref. del artículo: S_481265815
Cantidad disponible: 1 disponibles
Librería: Mooney's bookstore, Den Helder, Holanda
Condición: As New. Nº de ref. del artículo: D5ACB2709FDD376
Cantidad disponible: 1 disponibles
Librería: Antiquariat Bernhardt, Kassel, Alemania
Condición: Sehr gut. XI, 363 S. The Kluwer International Series in Engineering and Computer Science, 241. Zust: Gutes Exemplar. Einband leicht berieben. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 676 gebundene Ausgabe gebundene Ausgabe. Nº de ref. del artículo: 489925
Cantidad disponible: 1 disponibles
Librería: Buchpark, Trebbin, Alemania
Condición: Sehr gut. Zustand: Sehr gut | Seiten: 363 | Sprache: Englisch | Produktart: Bücher | 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. Nº de ref. del artículo: 1657355/202
Cantidad disponible: 1 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9780792393757
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 1212223-n
Cantidad disponible: Más de 20 disponibles
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
hardcover. Condición: New. In shrink wrap. Looks like an interesting title! Nº de ref. del artículo: Q-0792393759
Cantidad disponible: 1 disponibles