Dagstuhl Seminar 9151
Algorithms of Computeralgebra
( Dec 16 – Dec 20, 1991 )
Permalink
Organizers
- B. Buchberger
- F. Schwarz
- J. Davenport
Contact
Computer algebra has been established as a new field on the borderline between mathematics and computer science for about 20 years now. It has been the goal of this seminar to get together researchers from various subfields in a well balanced mixture. There have been two talks on polynomial factorization (Kaltofen, von zur Gathen), two on number theory (Pethö, Zimmer), five on Gröbner base theory and elimination (Lazard, Möller, Pedersen and Sturmfels, Traverso, Weispfenning), three talks on differential equations (Bronstein, Singer, Schwarz), a talk on Lie algebras (Laßner), on group theory (Michler), on arithmetic (Schonhage), on asymptotic analysis (Gonnet), on algbraic geometry (Giusti and Heintz) and on polynomial zeros (Krandick).
There will be hardly any other field where researchers with such a wide range of interests and different backgrounds have joined to form a new community as it is true for computer algebra. This becomes obvious just by looking at the contents of this brochure. In this situation it is especially important to get together in an informal manner such that new relations between researchers from these various subfields hopefully will be established. With this goal in mind, Schloß Dagstuhl is the ideal place to go. Therefore it will be an important aim to repeat these seminars on a two year schedule.

- B. Buchberger
- F. Schwarz
- J. Davenport