International Conference on Polynomial System Solving
Paris, November 24-25-26, 2004
Paris 6, University
There is no registration fee for the conference.
Advertisement
Invited Talks
-
B. Buchberger (Research Institute for Symbolic Computation, Austria)
Algorithmic invention of algorithms: case staudy Groebner bases.
-
J. Calmet (Universitat Karlsruhe Germany) :
Involutive bases, Grobner bases and combinatorics.
-
J. Davenport (Bath University, UK)
-
H. Hong (North Carolina State University)
-
M.F. Roy (Universite de Rennes 1, France) :
Algorithms in real algebraic geometry : recent results and open problems.
-
C. Traverso (Universita di Pisa, Italy)
Approximate arithmetics and polynomial algebra.
Program Committee
Program Chair : Annick Valibouze (Paris 6 University, France)
-
D. Augot (INRIA Rocquencourt, France)
-
C. Brown (United States Naval Academy , USA)
-
X.-S. Gao (Academy of Mathematics and System Sciences, China)
-
H. Hong (North Carolina State University, USA)
-
E. Hubert (INRIA Sophia-Antipolis, France)
-
I. Kotsireas (Wilfrid Laurier University, Canada)
-
B. Mourrain (INRIA Sophia-Antipolis, France)
-
E. Schost (Ecole polytechnique, France)
-
A. Steel (University of Sydney, Australia)
-
B. Sturmfels (Berkeley University, USA)
-
K. Yokoyama (Faculty of Mathematics, Kyushu University, Japan)
Local Organizers
Useful Informations
The conference
is organized by the Computer Algebra Team (CalFor) of LIP6 (Paris 6 University)
and the SALSA
INRIA-LIP6 project.