Seminar, Theoretical computer science

No calendar events were found within the current period.

Upcoming calendar events:

• Ciaran McCreesh: Finding little graphs inside big graphs (in parallel)

  10 Mar

  Seminar, Theoretical computer science

  Friday 2017-03-10, 12:00

  Participating: Ciaran McCreesh, University of Glasgow

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

  2017-03-10T12:00:00.000+01:00 2017-03-10T12:00:00.000+01:00 Ciaran McCreesh: Finding little graphs inside big graphs (in parallel) (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Ciaran McCreesh: Finding little graphs inside big graphs (in parallel) (Seminar, Theoretical computer science)

• Aaron Potechin: A nearly tight sum-of-squares lower bound for the planted clique problem

  13 Mar

  Seminar, Theoretical computer science

  Monday 2017-03-13, 12:00

  Participating: Aaron Potechin, Institute for Advanced Study

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

  2017-03-13T12:00:00.000+01:00 2017-03-13T12:00:00.000+01:00 Aaron Potechin: A nearly tight sum-of-squares lower bound for the planted clique problem (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Aaron Potechin: A nearly tight sum-of-squares lower bound for the planted clique problem (Seminar, Theoretical computer science)

• Prahladh Harsha: On polynomial approximations to AC0

  15 Mar

  Seminar, Theoretical computer science

  Wednesday 2017-03-15, 10:00

  Participating: Prahladh Harsha, (Tata Institute of Fundamental Research)

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

  2017-03-15T10:00:00.000+01:00 2017-03-15T10:00:00.000+01:00 Prahladh Harsha: On polynomial approximations to AC0 (Seminar, Theoretical computer science) Room 4523, Lindstedtsvägen 5, KTH CSC (KTH, Stockholm, Sweden)Prahladh Harsha: On polynomial approximations to AC0 (Seminar, Theoretical computer science)