Unlocking the Mysteries of Geometric Complexity Theory (GCT) π: Overcoming Algorithmic Challenges in Invariant Theory
Join Ketan D. Mulmuley as he explores the forefront of Geometric Complexity Theory, highlighting key algorithmic hurdles in invariant theory and their implications for computational complexity.

Institute for Advanced Study
952 views β’ Jun 8, 2018

About this video
Optimization, Complexity and Invariant Theory
Topic: Geometric complexity theory (GCT): Algorithmic challenges in invariant theory
Speaker: Ketan D. Mulmuley
Affiliation: University of Chicago
Date: June 6. 2018
For more videos, please visit http://video.ias.edu
Topic: Geometric complexity theory (GCT): Algorithmic challenges in invariant theory
Speaker: Ketan D. Mulmuley
Affiliation: University of Chicago
Date: June 6. 2018
For more videos, please visit http://video.ias.edu
Video Information
Views
952
Likes
9
Duration
01:09:50
Published
Jun 8, 2018
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now