City:
Test
Saint Petersburg
Novosibirsk
Kazan
Language:
Русский
English
About CS Club
Courses
Lecturers
Schools
Login
Registration
Теорема Разборова о нижней оценке на сложность монотонных схем
Hardness vs Randomness
What:
Lecture
When:
Sunday, 15 February 2009, 10:10–11:40
Where:
ПОМИ РАН
Slides:
hardnessvsrandomness_lecture_150209.pdf