Recherche
Many classes of Boolean functions can be tested much faster than they can be learned. However, this speedup tends to rely on query access to the
Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many
In automated learning problems, the task is to find a model that maps given inputs to their corresponding outputs as accurately as possible. Over the
Petra Wolf, «Kernelizing Temporal Exploration Problems» Abstract: We study the kernelization of exploration problems on temporal graphs. A temporal
Titre: "ON ROBUSTNESS FOR THE SKOLEM and related PROBLEMS" Blaise Genest (IPAL, Singapore) abstract: The Skolem problem is a long-standing open
[Soutenance en anglais/Talk in english] Cette thèse traite des questions structurelles de la théorie des graphes qui découlent de motivations