Recherche

Tensor networks (TNs) offer powerful algorithms for simulating quantum systems, but struggle to represent states with high entanglement. In contrast

/Exposé en anglais/Talk in english/ Twin-width is a graph invariant recently introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20]. The core

In this talk, we will consider the computational complexity of solving stochastic games with mean-payoff objectives, where ($\epsilon$-)optimal

/Exposé /Talk/ The chromatic number and clique number are well-studied notions that have motivated a significant part of the research in graph theory

Wolfgang-OP: A Robust Humanoid Robot Platform for Research and Competitions Jasper Güldenstein Visio: https://u-bordeaux-fr.zoom.us/j/83483228567

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 this talk, I will discuss the entanglement properties of mixtures of Dicke states. These quantum states form an important subclass of bosonic

Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments (continued) This paper deals with the trade-off