Representation Theory in TCS and Extremal Combinatorics
Subscribers:
68,600
Published on ● Video Link: https://www.youtube.com/watch?v=xlI-o48vIrs
Nathan Lindzey (Technion - Israel Institute of Technology)
https://simons.berkeley.edu/talks/nathan-lindzey-technion-israel-institute-technology-2023-06-30
Beyond the Boolean Cube
We give a gentle introduction to Representation Theory and show how it can be used to extend the theory of Boolean functions to other domains to obtain new results in TCS and Extremal Combinatorics.
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Beyond the Boolean Cube
Nathan Lindzey