Recherche

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture

The well-known Nerode equivalence for finite words plays a fundamental role in our understanding of the class of regular languages. The equivalence

/Exposé en anglais/Talk in english/ The Maker-Breaker game is played on a hypergraph H. Maker and Breaker take turns coloring vertices of H, in red

Mouna Safir (IRIF) Title: Some new results with k-set agreement Abstract: In this talk, I will present our investigation of the solvability of k-set

In recent years, machine learning (ML) has emerged as a powerful tool in chemistry, enabling the discovery of new patterns in data, providing insights

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture

A sublinear-time quantum algorithm for approximating partition functions Gibbs partition functions are ubiquitous in statistical physics and in

Akka Zemari (LaBRI) Title: (Online) Continual Learning Abstract: In real-world supervised learning, training data is often unavailable simultaneously

Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States