City:
Test
Saint Petersburg
Novosibirsk
Kazan
Language:
Русский
English
About CS Club
Courses
Lecturers
Schools
Login
Registration
Непересекающиеся NP-пары
Proof complexity
What:
Lecture
When:
Thursday, 07 October 2010, 18:30–20:55
Where:
ПОМИ РАН
Slides:
proofcomplexity_lecture_071010.pdf
Video
Attached files
20101007_proof_complexity_hirsch_lecture04_lecture_notes.pdf
