zippel richard (35 resultados)

Soft Cover. Condición: New. New condition. 114 pages. Illustrated.

Hardcover. 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.

Paperback. Condición: New.

Condición: New. Num Pages: 46 pages, 2 black & white illustrations, 45 black & white tables, biography. BIC Classification: MJM. Category: (P) Professional & Vocational. Dimension: 244 x 170 x 3. Weight in Grams: 130. . 1977. Paperback. . . . .

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.

Condición: New. Num Pages: 46 pages, 2 black & white illustrations, 45 black & white tables, biography. BIC Classification: MJM. Category: (P) Professional & Vocational. Dimension: 244 x 170 x 3. Weight in Grams: 130. . 1977. Paperback. . . . . Books ship from the US and Ireland.

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.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book contains papers presented at a workshop on the useof parallel techniques in symbolic and algebraic computationheld at Cornell University in May 1990. The eight papers inthe book fall into three groups.The first three papers discuss particular programmingsubstrates for parallel symbolic computation, especially fordistributed memory machines. The next three papers discussnovel ways of computing with elements of finite fields andwith algebraic numbers. The finite field technique isespecially interesting since it uses the Connection Machine,a SIMD machine, to achievesurprising amounts ofparallelism. One of the parallel computing substrates isalso used to implement a real root isolation technique.One of the crucial algorithms in modern algebraiccomputation is computing the standard, or Gr|bner, basis ofan ideal. The final two papers discuss two differentapproaches to speeding their computation. One uses vectorprocessing on the Cray and achieves significant speed-ups.The other uses a distributed memory multiprocessor andeffectively explores the trade-offs involved with differentinterconnect topologies of the multiprocessors.

Condición: Very good.

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.

Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | This book contains papers presented at a workshop on the useof parallel techniques in symbolic and algebraic computationheld at Cornell University in May 1990. The eight papers inthe book fall into three groups.The first three papers discuss particular programmingsubstrates for parallel symbolic computation, especially fordistributed memory machines. The next three papers discussnovel ways of computing with elements of finite fields andwith algebraic numbers. The finite field technique isespecially interesting since it uses the Connection Machine,a SIMD machine, to achievesurprising amounts ofparallelism. One of the parallel computing substrates isalso used to implement a real root isolation technique.One of the crucial algorithms in modern algebraiccomputation is computing the standard, or Gr|bner, basis ofan ideal. The final two papers discuss two differentapproaches to speeding their computation. One uses vectorprocessing on the Cray and achieves significant speed-ups.The other uses a distributed memory multiprocessor andeffectively explores the trade-offs involved with differentinterconnect topologies of the multiprocessors.

Condición: New.

Condición: New.

Condición: New. pp. 380.

Condición: New.

Condición: New.

Gebunden. 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.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book contains papers presented at a workshop on the useof parallel techniques in symbolic and algebraic computationheld at Cornell University in May 1990. The eight papers inthe book fall into three groups.The first three papers discuss particular programmingsubstrates for parallel symbolic computation, especially fordistributed memory machines. The next three papers discussnovel ways of computing with elements of finite fields andwith algebraic numbers. The finite field technique isespecially interesting since it uses the Connection Machine,a SIMD machine, to achievesurprising amounts ofparallelism. One of the parallel computing substrates isalso used to implement a real root isolation technique.One of the crucial algorithms in modern algebraiccomputation is computing the standard, or Gr|bner, basis ofan ideal. The final two papers discuss two differentapproaches to speeding their computation. One uses vectorprocessing on the Cray and achieves significant speed-ups.The other uses a distributed memory multiprocessor andeffectively explores the trade-offs involved with differentinterconnect topologies of the multiprocessors. 128 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book contains papers presented at a workshop on the useof parallel techniques in symbolic and algebraic computationheld at Cornell University in May 1990. The eight papers inthe book fall into three groups.The first three papers discuss particular.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book contains papers presented at a workshop on the useof parallel techniques in symbolic and algebraic computationheld at Cornell University in May 1990. The eight papers inthe book fall into three groups.The first three papers discuss particular programmingsubstrates for parallel symbolic computation, especially fordistributed memory machines. The next three papers discussnovel ways of computing with elements of finite fields andwith algebraic numbers. The finite field technique isespecially interesting since it uses the Connection Machinea SIMD machine, to achievesurprising amounts ofparallelism. One of the parallel computing substrates isalso used to implement a real root isolation technique.One of the crucial algorithms in modern algebraiccomputation is computing the standard, or Gr|bner, basis ofan ideal. The final two papers discuss two differentapproaches to speeding their computation. One uses vectorprocessing on the Cray and achieves significant speed-ups.The other uses a distributed memory multiprocessor andeffectively explores the trade-offs involved with differentinterconnect topologies of the multiprocessors.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 128 pp. Englisch.

Taschenbuch. Condición: Neu. Computer Algebra and Parallelism | Second International Workshop, Ithaca, USA, May 9-11, 1990. Proceedings | Richard E. Zippel | Taschenbuch | xi | Englisch | 1992 | Springer | EAN 9783540553281 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Condición: new. Questo è un articolo print on demand.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 380 pp. Englisch.