Seminarium, Teoretisk datalogi

Kalenderhändelser saknas för aktuell period.

Kommande kalenderhändelser:

• Avishay Tal: Improved pseudorandomness for unordered branching programs through local monotonicity

  9 apr

  Seminarium, Teoretisk datalogi

  måndag 2018-04-09, 12.00

  Medverkande: Avishay Tal, Stanford University

  Plats: Room 4523, Lindstedtsvägen 5, KTH

  2018-04-09T12:00:00.000+02:00 2018-04-09T12:00:00.000+02:00 Avishay Tal: Improved pseudorandomness for unordered branching programs through local monotonicity (Seminarium, Teoretisk datalogi) Room 4523, Lindstedtsvägen 5, KTH (KTH, Stockholm, Sweden)Avishay Tal: Improved pseudorandomness for unordered branching programs through local monotonicity (Seminarium, Teoretisk datalogi)

• Susanna F. de Rezende: Clique Is Hard on Average for Regular Resolution

  11 apr

  Seminarium, Teoretisk datalogi

  onsdag 2018-04-11, 12.00

  Medverkande: Susanna F. de Rezende, TCS Group, KTH

  Plats: Room 4523, Lindstedtsvägen 5, KTH

  2018-04-11T12:00:00.000+02:00 2018-04-11T12:00:00.000+02:00 Susanna F. de Rezende: Clique Is Hard on Average for Regular Resolution (Seminarium, Teoretisk datalogi) Room 4523, Lindstedtsvägen 5, KTH (KTH, Stockholm, Sweden)Susanna F. de Rezende: Clique Is Hard on Average for Regular Resolution (Seminarium, Teoretisk datalogi)

• Daniela Ritirc: On the problem of arithmetic circuit verification using computer algebra

  23 apr

  Seminarium, Teoretisk datalogi

  måndag 2018-04-23, 12.00

  Medverkande: Daniela Ritirc, Johannes Kepler Universität Linz

  Plats: Room 4523, Lindstedtsvägen 5, KTH

  2018-04-23T12:00:00.000+02:00 2018-04-23T12:00:00.000+02:00 Daniela Ritirc: On the problem of arithmetic circuit verification using computer algebra (Seminarium, Teoretisk datalogi) Room 4523, Lindstedtsvägen 5, KTH (KTH, Stockholm, Sweden)Daniela Ritirc: On the problem of arithmetic circuit verification using computer algebra (Seminarium, Teoretisk datalogi)