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

Finite Groups and Complexity Theory: from Leningrad to Saint Petersburg via Las Vegas

Лекции курса

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 Vegas▶ Вы тут
  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