9783540240617 - modular algorithms in symbolic summation and symbolic integration (lecture notes in computer science, 3218, band 3218) von gerhard, j¿¿rgen (4 Ergebnisse)
- Softcover
Anbieter: Books From California, Simi Valley, CA, USABooks From California
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht - Befriedigend
EUR 11,85
EUR 4,32 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Paperback. Zustand: Good. Ex-library copy with usual markings. Shows very minor wear.
- Softcover
Anbieter: BookOrders, Russell, IA, USABookOrders
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Befriedigend
EUR 16,04
EUR 3,46 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
Soft Cover. Zustand: Good. Lecture Notes in Computer Science (LNCS) 3218. Usual ex-library features. The interior is clean and tight. Binding is good. Cover shows slight wear. 224 pages. Ex-Library.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 60,98
EUR 13,96 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 53,49
EUR 61,86 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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.
