The Conference will be devoted to modern polynomial algorithms in Computer Algebra which are gaining importance in various applications of science
as well as in fundamental researches.
Conference chair:
N. Vasiliev
Organizing committee:
N. Vasiliev, E. Novikova, Ya. Shibaeva
(secretary), N. Zalesskaya
(secretary)
Program committee:
B.Buchberger (Schloss Hagenberg, Austria), V.Gerdt (Dubna, Russia), P.Gianni (Pisa, Italy),
D.Grigoriev (Bonn, Germany), V.Pan (New York, USA), L.Robbiano (Genova, Italy),
N.Vasiliev (St. Petersburg, Russia), A. Vershik (St. Petresburg, Russia), S.Watt (Western Ontario, Canada).
Topics:
Groebner bases
Combinatorics of monomial orderings
Differential bases
Involutive algorithms
Computational algebraic geometry
D-modules
Polynomial differential operators
Parallelization of algorithms
Quantum computing
Cryptography
Tropical manifolds
Matrix algorithms
Complexity of algorithms
others
Official languages: English, Russian.
Previous Conference Polynomial Computer Algebra '2008
Extended abstracts of presentation in English up to 4 pages
(pdf-file prepared
using LaTeX with the style file birkmult.zip).
Attention. Deadline for paper submission and
registration has been prolonged till
March, 17 .
Limited funds for financial support for Russian participiants are
available from RFBR grant.
Registration fee is 200 €. For Russian participants
the fee could be covered by the RFBR grant.
Do not hesitate to contact the organizers
by the following E-mail address:
pca@imi.ras.ru