Product Type
Condition
Binding
Collectible Attributes
Free Shipping
Seller Location
Seller Rating
Published by Springer-Verlag New York, Incorporated, New York, NY, U.S.A., 1992
ISBN 10: 0387553282ISBN 13: 9780387553283
Seller: Book Booth, Berea, OH, U.S.A.
Book
Soft Cover. Condition: New. New condition. 114 pages. Illustrated.
Published by HMSO, 1960
Seller: Cambridge Rare Books, Cambridge, GLOUC, United Kingdom
First Edition
Hardback. Condition: GOOD. 1st Edition. 1960. HMSO. First. Disbound loose sheets with clear protective cover. 7.5x11. Complete specification for patent application together with drawings.
Published by Springer, 1992
ISBN 10: 3540553282ISBN 13: 9783540553281
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Soft Cover. Condition: new.
Published by Kohlhammer 2018-07-25, 2018
ISBN 10: 3170322850ISBN 13: 9783170322851
Seller: Blackwell's, London, United Kingdom
Book
paperback. Condition: New. Language: GER.
Published by Springer, 1992
ISBN 10: 3540553282ISBN 13: 9783540553281
Seller: Mispah books, Redhill, SURRE, United Kingdom
Book
Paperback. Condition: Like New. Like New. book.
Published by Springer, 1992
ISBN 10: 3540553282ISBN 13: 9783540553281
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 1992
ISBN 10: 3540553282ISBN 13: 9783540553281
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Kluwer, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: MB Books, Derbyshire, United Kingdom
Book
Hardcover. Condition: 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.
Published by Springer 1992-03, 1992
ISBN 10: 3540553282ISBN 13: 9783540553281
Seller: Chiron Media, Wallingford, United Kingdom
Book
PF. Condition: New.
Published by Springer Berlin Heidelberg Mrz 1992, 1992
ISBN 10: 3540553282ISBN 13: 9783540553281
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
Taschenbuch. Condition: 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.
Published by Springer Berlin Heidelberg, 1992
ISBN 10: 3540553282ISBN 13: 9783540553281
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
Taschenbuch. Condition: 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.
Published by Kluwer Academic Publishers, Boston MA, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: Chequamegon Books, Washburn, WI, U.S.A.
Book
Hardcover. Condition: 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.
Published by Springer Berlin Heidelberg, 1992
ISBN 10: 3540553282ISBN 13: 9783540553281
Seller: moluna, Greven, Germany
Book Print on Demand
Condition: 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.
Published by Boston, Dordrecht, London: Kluwer Publishers, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: Antiquariat Bernhardt, Kassel, Germany
Book
gebundene Ausgabe. The Kluwer International Series in Engineering and Computer Science, 241. Zust: Gutes Exemplar. Einband leicht berieben. XI, 363 S. Englisch 676g.
Published by Springer, 2012
ISBN 10: 1461363985ISBN 13: 9781461363989
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Soft Cover. Condition: new.
Published by Springer, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Hardcover. Condition: new.
Published by Springer, 2012
ISBN 10: 1461363985ISBN 13: 9781461363989
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer Science & Business Media, 1993
Seller: Collectors' Bookstore, Antwerpen, Belgium
Book First Edition
Hardcover. Condition: Fine. First Edition. First Edition thus, very fine condition. Effective Polynomial Computation Special Collection by Richard Zippel. Published by Springer Science & Business Media in 1993. Hardcover. What makes this title so special is its limited availability. - Publishers Weekly. Collectible item in excellent condition.
Published by Springer, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 2012
ISBN 10: 1461363985ISBN 13: 9781461363989
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer US, 2012
ISBN 10: 1461363985ISBN 13: 9781461363989
Seller: moluna, Greven, Germany
Book Print on Demand
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.
Published by Springer US, 2012
ISBN 10: 1461363985ISBN 13: 9781461363989
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
Taschenbuch. Condition: 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.
Published by Springer, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: California Books, Miami, FL, U.S.A.
Book
Condition: New.
Published by Springer US, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: moluna, Greven, Germany
Book Print on Demand
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.
Published by Springer Jul 1993, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
Buch. Condition: 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.
Published by Springer US Okt 2012, 2012
ISBN 10: 1461363985ISBN 13: 9781461363989
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
Taschenbuch. Condition: 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.
Published by Springer, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: Front Cover Books, Denver, CO, U.S.A.
Book
Condition: new.
Published by Springer, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
Buch. Condition: 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.
Published by Springer, 1993
ISBN 10: 0792393759ISBN 13: 9780792393757
Seller: Mispah books, Redhill, SURRE, United Kingdom
Book
Hardcover. Condition: Like New. Like New. book.