Seminarium, Teoretisk datalogi

Kalenderhändelser saknas för aktuell period.

Kommande kalenderhändelser:

• Michele Scquizzato: Distributed computation of large-scale graph problems

  13 nov

  Seminarium, Teoretisk datalogi

  måndag 2017-11-13, 12.00

  Medverkande: Michele Scquizzato, TCS Group, KTH

  Plats: Room 4523, Lindstedtsvägen 5, KTH CSC 

  2017-11-13T12:00:00.000+01:00 2017-11-13T12:00:00.000+01:00 Michele Scquizzato: Distributed computation of large-scale graph problems (Seminarium, Teoretisk datalogi) Room 4523, Lindstedtsvägen 5, KTH CSC  (KTH, Stockholm, Sweden)Michele Scquizzato: Distributed computation of large-scale graph problems (Seminarium, Teoretisk datalogi)

• Jakob Nordström: Understanding conflict-driven SAT solving through the lens of proof complexity

  20 nov

  Seminarium, Teoretisk datalogi

  måndag 2017-11-20, 12.00

  Medverkande: Jakob Nordström, TCS Group, KTH

  Plats: Room 4523, Lindstedtsvägen 5, KTH CSC 

  2017-11-20T12:00:00.000+01:00 2017-11-20T12:00:00.000+01:00 Jakob Nordström: Understanding conflict-driven SAT solving through the lens of proof complexity (Seminarium, Teoretisk datalogi) Room 4523, Lindstedtsvägen 5, KTH CSC  (KTH, Stockholm, Sweden)Jakob Nordström: Understanding conflict-driven SAT solving through the lens of proof complexity (Seminarium, Teoretisk datalogi)

• Johannes Klaus Fichte: Parameterized complexity of answer set programming

  27 nov

  Seminarium, Teoretisk datalogi

  måndag 2017-11-27, 12.00

  Medverkande: Johannes Klaus Fichte, Technische Universität Wien

  Plats: Room 4523, Lindstedtsvägen 5, KTH CSC 

  2017-11-27T12:00:00.000+01:00 2017-11-27T12:00:00.000+01:00 Johannes Klaus Fichte: Parameterized complexity of answer set programming (Seminarium, Teoretisk datalogi) Room 4523, Lindstedtsvägen 5, KTH CSC  (KTH, Stockholm, Sweden)Johannes Klaus Fichte: Parameterized complexity of answer set programming (Seminarium, Teoretisk datalogi)