Seminar, Theoretical computer science
Wed 23 November
-
Seminar, Theoretical computer science
Wednesday 2016-11-23, 13:15 - 15:00
Participating: Pavel Pudlák, Institute of Mathematics, Czech Academy of Sciences
Location: Room 4523, Lindstedtsvägen 5, KTH CSC
2016-11-23T13:15:00.000+01:00 2016-11-23T15:00:00.000+01:00 Pavel Pudlák: The lower bound challenge in proof complexity (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Pavel Pudlák: The lower bound challenge in proof complexity (Seminar, Theoretical computer science)