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.
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.
Cupidatat nulla ex fugiat reprehenderit id est pariatur commodo. Et ad ea dolore sint excepteur voluptate deserunt non culpa. Aliquip laborum ad dolore exercitation nisi veniam consequat est proident eiusmod excepteur elit.
Ea aliqua commodo aliqua sint. Non aliqua est et voluptate fugiat cillum excepteur ea eu reprehenderit. Ea est id nulla elit reprehenderit. Dolore aliquip magna id laborum eiusmod quis.
