BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:2eaf932d-918c-4cfa-b6af-2091c77f7835
X-WR-CALNAME:[M2F] Arnaud Durand
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20251026T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:2eaf932d-918c-4cfa-b6af-2091c77f7835
DTSTAMP:20260428T210303Z
CLASS:PUBLIC
DESCRIPTION:** Enumeration Classes Defined by Circuits **\n\nWe refine the 
 complexity landscape for enumeration problems by introducing very low clas
 ses defined by using Boolean circuits as enumerators. We locate well-known
  enumeration problems\, e.g.\, from graph theory\, Gray code enumeration\,
  and propositional satisfiability in our classes. In this way we obtain a 
 framework to distinguish between the complexity of different problems know
 n to be computable with polynomial delay\, for which a formal way of compa
 rison was not possible to this day. The approach offers a different measur
 e of efficient enumeration such as the one defined using Constant Delay in
  the context of enumeration for query answering.\nThis is joint work with 
 Nadia Creignou and Heribert Vollmer.
DTSTART;TZID=Europe/Paris:20240409T140000
DTEND;TZID=Europe/Paris:20240409T150000
LOCATION:LaBRI
SEQUENCE:0
SUMMARY:[M2F] Arnaud Durand
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
