Polynomial Computer Algebra '2011
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.
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).
Official languages: English, Russian.
The conference is supported by RFBR ¹11-01-06019. Russian participants please see the link for reimbursement.
Extended abstracts of presentations in English up to 4 pages (pdf-file prepared using LaTeX) should be submitted before 7 March. The collection of abstracts is going to be published before the ConferenceDo not hesitate to contact the organizers by the following E-mail address: firstname.lastname@example.org