Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Boolean Hidden Matching Problem
Description
This lecture covers the Boolean Hidden Matching Problem, where Alice and Bob aim to find a matching of size n without revealing their inputs. The slides discuss message matching, total communication, and applications to lower bounds.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.