Recherche

We study the notion of k-stabilizer universal quantum state, that is, an n-qubit quantum state, such that it is possible to induce any stabilizer

/Exposé en anglais/Talk in english/ We consider an edge version of the famous (and hard) degree-diameter problem, where one is wondering about the

Given a relational specification \varphi(X, Y_1, ... Y_n), Boolean functional synthesis concerns the construction of Boolean functions F_1(X), ... F_n

We study zero-sum games played on graphs and present contributions toward the following question: given an objective, how much memory is required to

/Exposé en anglais/Talk in english/ The stack number of a directed acyclic graph G is the minimum k for which there is a topological ordering of G and

Age-related macular degeneration (AMD) is one of the leading causes of legal blindness worldwide. However, manual screening of the retina for

Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on

Detecting and Explaining Privacy Risks on Temporal Data Speaker: Marie-Christine Rousset, Professor at University of Grenoble Abstract: Personal data

An algebraic circuit computes a polynomial using addition and multiplication operators. Understanding the power of algebraic circuits has close

We show that interactive protocols between a prover and a verifier, a well-known tool of complexity theory, can be used in practice to certify the