Small-Set Expansion in the 2-Degree Short-Code Graph - The Easier Version
Offered By: Simons Institute via YouTube
Course Description
Overview
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.
Syllabus
Small-Set Expansion in the 2-Degree Short-Code Graph, the Easier Version
Taught by
Simons Institute
Related Courses
Code-Based CryptographyInria (French Institute for Research in Computer Science and Automation) via France Université Numerique Современная комбинаторика (Modern combinatorics)
Moscow Institute of Physics and Technology via Coursera An Introduction to Coding Theory
Indian Institute of Technology Kanpur via Swayam Introduction to Coding Theory
Indian Institute of Technology Kanpur via Swayam Coding Theory
NPTEL via YouTube