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
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer