BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20250225T104500
DTEND;TZID=Europe/Paris:20250225T114500
DTSTAMP:20260421T140248
CREATED:20250204T142225Z
LAST-MODIFIED:20250228T160524Z
UID:11791-1740480300-1740483900@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Enumeration Classes Defined by Circuits »\, Arnaud Durand (IMJ\, Univ. Paris-Diderot)
DESCRIPTION:Enumerating is the task of generating all solutions associated with an instance of a computational problem. We refine the complexity landscape for enumeration problems by introducing very low classes 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 (conditionally but also unconditionally) between the complexity of different problems known to be computable with polynomial delay\, for which a formal way of comparison was not possible to this day. The approach offers a different measure of efficient enumeration such as the one defined using Constant Delay in the context of enumeration for query answering. \nJoint work with Nadia Creignou and Heribert Vollmer.
URL:https://www.greyc.fr/event/seminaire-algorithmique-arnaud-durand-imj-univ-paris-diderot/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR