Recherche
Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States
Akka Zemari (LaBRI) Title: (Online) Continual Learning Abstract: In real-world supervised learning, training data is often unavailable simultaneously
The talk is in two parts. In the first part, we prove a lower bound on the scrambling speed of a random quantum circuit. We give three applications of
Ultrametrics are representations of data that emphasize hierarchical properties and are widely used in data visualization and clustering. In the
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