City:
Test
Saint Petersburg
Novosibirsk
Kazan
Language:
Русский
English
About CS Club
Courses
Lecturers
Schools
Login
Registration
Лекция
The computational complexity and foundations of cryptography
What:
Lecture
When:
Tuesday, 13 March 2012, 18:30–20:05
Where:
ПОМИ РАН
Description
QBF is PSPACE-complete. Hierarchies DSpace, DTime, NTime.
Video
