Polynomial Computer Algebra '2013

May 6-10, 2013

Euler International Mathematical Institute,
St. Petersburg, RUSSIA

The Conference is devoted to modern polynomial algorithms in Computer Algebra which are gaining importance in various applications of science as well as in fundamental researches.

Programme of the conference

Conference chair:   N. Vasiliev

Organizing committee: N. Vasiliev, M. Rybalkin, E. Novikova, T. Vinogradova (secretary), N. Zalesskaya (secretary)

Program committee: A.Akritas ( Greece), B.Buchberger (Schloss Hagenberg, Austria), V. Edneral (Moscow, Russia), V.Gerdt (Dubna, Russia), P.Gianni (Pisa, Italy), D.Grigoriev (Lille, France),A.Khovansky (Toronto,Canada),I.Kotsireas (Waterloo, Canada), A.Mylläri (Grenada), 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).

Groebner bases
Combinatorics of monomial orderings
Differential bases
Involutive algorithms
Computational algebraic geometry
Polynomial differential operators
Parallelization of algorithms
Algorithms of tropical mathematics
Quantum computing
Tropical manifolds
Matrix algorithms
Complexity of algorithms

Official languages: English, Russian.

Previous Conference:
Polynomial Computer Algebra '2008
Polynomial Computer Algebra '2009
Polynomial Computer Algebra '2010
Polynomial Computer Algebra '2011
Polynomial Computer Algebra '2012

Extended abstracts of presentations in English up to 4 pages (pdf-file prepared using LaTeX) should be submitted before 6 April. 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