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.
In this course we will define rigorous mathematical models for computing on large datasets, cover main algorithmic techniques that have been developed for sublinear (e.g. faster than linear time) data
