Seminar, Theoretical computer science
Tue 01 November - Sat 31 December
-
Seminar, Theoretical computer science
Monday 2016-11-07, 07:00
Participating: Jesús Giráldez Crú, Theory Group, KTH
Location: Room 4523, Lindstedtsvägen 5, KTH CSC
2016-11-07T07:00:00.000+01:00 2016-11-07T07:00:00.000+01:00 Jesús Giráldez Crú: Graph-based pseudo-industrial random SAT instance generators (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Jesús Giráldez Crú: Graph-based pseudo-industrial random SAT instance generators (Seminar, Theoretical computer science) -
Seminar, Theoretical computer science
Monday 2016-11-14, 13:15
Participating: Patrizio Pelliccione, Chalmers University of Technology
Location: Room 1440 Biblioteket, Lindstedtsvägen 3
2016-11-14T13:15:00.000+01:00 2016-11-14T13:15:00.000+01:00 Patrizio Pelliccione: Architecting the next generation of vehicles (Seminar, Theoretical computer science) Room 1440 Biblioteket, Lindstedtsvägen 3 (KTH, Stockholm, Sweden)Patrizio Pelliccione: Architecting the next generation of vehicles (Seminar, Theoretical computer science) -
Seminar, Theoretical computer science
Monday 2016-11-21, 12:00
Participating: Ilario Bonacina, Theory Group, KTH
Location: Room 4523, Lindstedtsvägen 5, KTH CSC
2016-11-21T12:00:00.000+01:00 2016-11-21T12:00:00.000+01:00 Ilario Bonacina: Strong size lower bounds in regular resolution via games (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Ilario Bonacina: Strong size lower bounds in regular resolution via games (Seminar, Theoretical computer science) -
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) -
Seminar, Theoretical computer science
Monday 2016-11-28, 12:00
Participating: Marc Vinyals, Theory Group, KTH
Location: Room 4523, Lindstedtsvägen 5, KTH CSC
2016-11-28T12:00:00.000+01:00 2016-11-28T12:00:00.000+01:00 Marc Vinyals: Marc VinyalsSpace in proof complexity (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Marc Vinyals: Marc VinyalsSpace in proof complexity (Seminar, Theoretical computer science)