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), D. Stefanescu (Bukharest, Romania), 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
Polynomial Computer Algebra '2009
PCA'2009 Photo Album

Extended abstracts of presentations in English up to 4 pages (pdf-file prepared using LaTeX) should be submitted before 2 March. The collection of abstracts is going to be published before the Conference

Do not hesitate to contact the organizers by the following E-mail address: pca@imi.ras.ru