BEGIN:VCALENDAR PRODID:-//AT Content Types//AT Event//EN VERSION:2.0 METHOD:PUBLISH BEGIN:VEVENT DTSTAMP:20160930T194349Z CREATED:20120921T070128Z UID:ATEvent-eeef5608acbc0148a515a8b387039c4b LAST-MODIFIED:20120921T070555Z SUMMARY:Informatik-Kolloquium Di\, 02.10.2012\, 14\:15 Uhr\, Raum 123 DTSTART:20121002T121500Z DTEND:20121002T134500Z DESCRIPTION:Prof. Antonina Kolokolova\: How hard is proving hardness? A logic approach to barriers in complexity. LOCATION:Raum 123\, Oettingenstraße 67 CATEGORIES:Kolloquium CLASS:PUBLIC END:VEVENT END:VCALENDAR