Polynomial Algorithms in Computer Algebra by Franz Winkler
For several years now I have been teaching courses in computer algebra at the Universitat Linz, the University of Delaware, and the Universidad de Alcala de Henares. In the summers of 1990 and 1992 I have organized and taught summer schools in computer algebra at the Universitat Linz. Gradually a set of course notes has emerged from these activities. People have asked me for copies of the course notes, and different versions of them have been circulating for a few years. Finally I decided that I should really take the time to write the material up in a coherent way and make a book out of it. Here, now, is the result of this work. Over the years many students have been helpful in improving the quality of the notes, and also several colleagues at Linz and elsewhere have contributed to it. I want to thank them all for their effort, in particular I want to thank B. Buchberger, who taught me the theory of Grabner bases nearly two decades ago, B. F. Caviness and B. D. Saunders, who first stimulated my interest in various problems in computer algebra, G. E. Collins, who showed me how to compute in algebraic domains, and J. R. Sendra, with whom I started to apply computer algebra methods to problems in algebraic geometry. Several colleagues have suggested improvements in earlier versions of this book. However, I want to make it clear that I am responsible for all remaining mistakes.-
Advances in the Design of Symbolic Computation Systems
-
Algorithms in Invariant Theory
-
An Invitation to Analytic Combinatorics
-
An Introduction to Computational Origami
-
The Concrete Tetrahedron
-
Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra
-
Numerical and Symbolic Scientific Computing
-
Anti-Differentiation and the Calculation of Feynman Amplitudes
-
Integration in Finite Terms: Fundamental Sources
-
Approximate Commutative Algebra
-
Concrete Abstractions
-
Elliptic Integrals, Elliptic Functions and Modular Forms in Quantum Field Theory
-
Computer - Human Interaction in Symbolic Computation
-
Loewy Decomposition of Linear Differential Equations
-
Thinking Programs
-
Correct Software in Web Applications and Web Services
-
Mechanical Theorem Proving in Geometries
-
Computer-Supported Calculus
-
The Symbolic Computation of Integrability Structures for Partial Differential Equations
-
Computer Algebra in Quantum Field Theory
-
Quantifier Elimination and Cylindrical Algebraic Decomposition
| SKU | Unavailable |
| ISBN 13 | 9783211827598 |
| ISBN 10 | 3211827595 |
| Title | Polynomial Algorithms in Computer Algebra |
| Author | Franz Winkler |
| Series | Texts And Monographs In Symbolic Computation Ser |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer Verlag GmbH |
| Year published | 1996-08-02 |
| Number of pages | 270 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |