The 6th International Computer Science Symposium in Russia
June 14–18, 2011, St. Petersburg, Russia
MyCSRSuckerfishMenu
Call for Papers
Program
Invited Speakers
Workshops
Committees
Proceedings
Venue
Practical Info
Photos
Complexity lower bounds for algebraic computation trees
Talk:
Dima Grigoriev. Complexity lower bounds for algebraic computation trees
Date:
Tue, 06/14/2011 - 09:30
Slides:
CSR2011_June14_09_30_Grigoriev.pdf
Submitted by kulikov on Tue, 06/14/2011 - 10:02