The deadline for registration and submissions is extended till 25 March.
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.
N. Vasiliev, E. Novikova, T. Vinogradova
(secretary), N. Zalesskaya
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.Myllari (Turku, Finland), 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).
Combinatorics of monomial orderings
Computational algebraic geometry
Polynomial differential operators
Parallelization of algorithms
Algorithms of tropical mathematics
Complexity of algorithms
Official languages: English, Russian.
The conference is supported by RFBR ¹12-01-06020-ã. Russian participants please see the link for reimbursement.
Polynomial Computer Algebra '2008
Polynomial Computer Algebra '2009
Polynomial Computer Algebra '2010
Polynomial Computer Algebra '2011
Extended abstracts of presentations in English up to 4 pages
(pdf-file prepared using LaTeX) should be submitted before 25 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: