Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 11,83
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Good. Ex-library copy with usual markings. Shows very minor wear.
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
EUR 16,01
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Very Good. Ex-library paperback in nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 63,04
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 60,63
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 74,10
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 60,62
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 66,76
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This work brings together two streams in computer algebra: symbolic integration and summation on the one hand, and fast algorithmics on the other hand. In many algorithmically oriented areas of computer science, theanalysisof- gorithms-placedintothe limelightbyDonKnuth'stalkat the 1970ICM -provides a crystal-clear criterion for success. The researcher who designs an algorithmthat is faster (asymptotically, in the worst case) than any previous method receives instant grati cation: her result will be recognized as valuable. Alas, the downside is that such results come along quite infrequently, despite our best efforts. An alternative evaluation method is to run a new algorithm on examples; this has its obvious problems, but is sometimes the best we can do. George Collins, one of the fathers of computer algebra and a great experimenter,wrote in 1969: 'I think this demonstrates again that a simple analysis is often more revealing than a ream of empirical data (although both are important). ' Within computer algebra, some areas have traditionally followed the former methodology, notably some parts of polynomial algebra and linear algebra. Other areas, such as polynomial system solving, have not yet been amenable to this - proach. The usual 'input size' parameters of computer science seem inadequate, and although some natural 'geometric' parameters have been identi ed (solution dimension, regularity), not all (potential) major progress can be expressed in this framework. Symbolic integration and summation have been in a similar state.
Librería: preigu, Osnabrück, Alemania
EUR 50,25
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Modular Algorithms in Symbolic Summation and Symbolic Integration | Jürgen Gerhard | Taschenbuch | xvi | Englisch | 2004 | Springer | EAN 9783540240617 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Dez 2004, 2004
ISBN 10: 3540240616 ISBN 13: 9783540240617
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This work brings together two streams in computer algebra: symbolic integration and summation on the one hand, and fast algorithmics on the other hand. In many algorithmically oriented areas of computer science, theanalysisof- gorithms-placedintothe limelightbyDonKnuth'stalkat the 1970ICM -provides a crystal-clear criterion for success. The researcher who designs an algorithmthat is faster (asymptotically, in the worst case) than any previous method receives instant grati cation: her result will be recognized as valuable. Alas, the downside is that such results come along quite infrequently, despite our best efforts. An alternative evaluation method is to run a new algorithm on examples; this has its obvious problems, but is sometimes the best we can do. George Collins, one of the fathers of computer algebra and a great experimenter,wrote in 1969: 'I think this demonstrates again that a simple analysis is often more revealing than a ream of empirical data (although both are important). ' Within computer algebra, some areas have traditionally followed the former methodology, notably some parts of polynomial algebra and linear algebra. Other areas, such as polynomial system solving, have not yet been amenable to this - proach. The usual 'input size' parameters of computer science seem inadequate, and although some natural 'geometric' parameters have been identi ed (solution dimension, regularity), not all (potential) major progress can be expressed in this framework. Symbolic integration and summation have been in a similar state. 240 pp. Englisch.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2004
ISBN 10: 3540240616 ISBN 13: 9783540240617
Librería: moluna, Greven, Alemania
EUR 48,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes supplementary material: sn.pub/extrasThis work brings together two streams in computer algebra: symbolic integration and summation on the one hand, and fast algorithmics on the other hand. In many algorithmically oriented areas of comput.
Idioma: Inglés
Publicado por Springer, Springer Dez 2004, 2004
ISBN 10: 3540240616 ISBN 13: 9783540240617
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This work brings together two streams in computer algebra: symbolic integration and summation on the one hand, and fast algorithmics on the other hand. In many algorithmically oriented areas of computer science, theanalysisof- gorithms¿placedintothe limelightbyDonKnuth¿stalkat the 1970ICM ¿provides a crystal-clear criterion for success. The researcher who designs an algorithmthat is faster (asymptotically, in the worst case) than any previous method receives instant grati cation: her result will be recognized as valuable. Alas, the downside is that such results come along quite infrequently, despite our best efforts. An alternative evaluation method is to run a new algorithm on examples; this has its obvious problems, but is sometimes the best we can do. George Collins, one of the fathers of computer algebra and a great experimenter,wrote in 1969: ¿I think this demonstrates again that a simple analysis is often more revealing than a ream of empirical data (although both are important). ¿ Within computer algebra, some areas have traditionally followed the former methodology, notably some parts of polynomial algebra and linear algebra. Other areas, such as polynomial system solving, have not yet been amenable to this - proach. The usual ¿input size¿ parameters of computer science seem inadequate, and although some natural ¿geometric¿ parameters have been identi ed (solution dimension, regularity), not all (potential) major progress can be expressed in this framework. Symbolic integration and summation have been in a similar state.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 240 pp. Englisch.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 115,61
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 240.