Small-Set Expansion in the 2-Degree Short-Code Graph - The Easier Version

Small-Set Expansion in the 2-Degree Short-Code Graph - The Easier Version

Explore a lecture on small-set expansion in the 2-degree short-code graph, presented by Guy Kindler from the Hebrew University of Jerusalem as part of the "Beyond the Boolean Cube" series at the Simons Institute. Delve into the intricacies of this mathematical concept, examining its applications and implications in computational complexity theory. Gain insights into the easier version of this problem and its relevance to broader topics in theoretical computer science during this hour-long presentation.