Librería: MB Books, Derbyshire, Reino Unido
EUR 56,55
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. 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.
Librería: Ammareal, Morangis, Francia
EUR 64,99
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Très bon. Ancien livre de bibliothèque avec équipements. Edition 1993. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1993. Ammareal gives back up to 15% of this item's net price to charity organizations.
Idioma: Inglés
Publicado por Kluwer Academic Publishers, Boston MA, 1993
ISBN 10: 0792393759 ISBN 13: 9780792393757
Librería: Chequamegon Books, Washburn, WI, Estados Unidos de America
EUR 87,52
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. 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.
Librería: Mooney's bookstore, Den Helder, Holanda
EUR 103,66
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Very good.
Idioma: Inglés
Publicado por Boston, Dordrecht, London: Kluwer Publishers, 1993
ISBN 10: 0792393759 ISBN 13: 9780792393757
Librería: Antiquariat Bernhardt, Kassel, Alemania
EUR 100,00
Cantidad disponible: 1 disponibles
Añadir al carritoCondició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.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 158,21
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 174,76
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 158,20
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
EUR 201,89
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
EUR 99,98
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Sehr gut. Zustand: Sehr gut | Seiten: 380 | 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.
EUR 178,14
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. 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.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 225,00
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
EUR 234,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 258,88
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: UK BOOKS STORE, London, LONDO, Reino Unido
EUR 262,59
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. Brand New! Fast Delivery "International Edition " and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 4-6 Working days .and we do have flat rate for up to 2LB. Extra shipping charges will be requested This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
EUR 247,94
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - 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.