ЛекториумМедиатека
Личный кабинет

The 6th International Computer Science Symposium in Russia

CSR is an annual conference that intends to reflect the broad scope of international cooperation in computer science. In 2006-2009 the symposium consisted of two tracks: Theory Track and Applications and Technology Track, and since 2010 it has a single track. The topics covered vary from year to year, but in general try to cover as much of the contemporary computer science as possible.

Лекции

9
  1. Complexity lower bounds for algebraic computation treesДмитрий Григорьев
  2. The Arithmetic Complexity of Euler FunctionManindra Agrawal
  3. Kolmogorov Complexity as a LanguageАлександр Шень
  4. Finite Groups and Complexity Theory: from Leningrad to Saint Petersburg via Las VegasLaszlo Babai
  5. Snakes and Cellular Automata: Reductions and Inseparability ResultsЯркко Кари
  6. Locally decodable codesСергей Еханин
  7. On the CSP Dichotomy conjectureAndrei Bulatov
  8. Recent Results on Polynomial Identity TestingAmir Shpilka
  9. The method of multiplicitiesMadhu Sudan

Онлайн-курсы по программированию

3