POLYNOMIAL COMPUTER ALGEBRA '2010

St. Petersburg, Russia

April 2 - 7, 2009

The Conference will be devoted to modern polynomial algorithms in computer algebra, which are gaining importance in various applications as well as in fundamental researches.

Conference chair: N. Vasiliev

Organizing committee: N. Vasiliev, E. Novikova, Ya. Shibaeva (secretary), N. Zalesskaya (secretary)

Scientific committee: V.Gerdt (Dubna, Russia), N.Vasiliev (St. Petersburg, Russia) (co-chairs).

B.Buchberger (Schloss Hagenberg, Austria), P.Gianni (Pisa, Italy), D.Grigoriev (Bonn, Germany), V.Pan (New York, USA), L.Robbiano (Genova, Italy), D.Stefanesku (Bukharest, Romania), A. Vershik (St. Petresburg, Russia), S.Watt (London (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

Criptography

Tropical manifolds

Matrix algorithms

Complexity of algorithms

others

Official languages: English, Russian.

Extended abstracts of talks in English up to 4 pages (pdf-file prepared using LaTeX with the style file birkmult.zip)should be submitted by 2 March.

Attention. Deadline for submission at the Conference is Mach, 2.

Registration fee is 200 Euro.

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