Unlocking Complexity Limits with Geometric Theory π: Insights from Christian Ikenmeyer
Explore how Geometric Complexity Theory offers new approaches to understanding computational lower bounds through algebraic geometry and representation theory, presented by Christian Ikenmeyer.

Simons Institute for the Theory of Computing
808 views β’ Aug 22, 2018

About this video
Christian Ikenmeyer, Max Planck Institute for Informatics
https://simons.berkeley.edu/talks/gct-lower-bounds-using-algebraic-geometry-and-representation-theory-i
Lower Bounds in Computational Complexity Boot Camp
https://simons.berkeley.edu/talks/gct-lower-bounds-using-algebraic-geometry-and-representation-theory-i
Lower Bounds in Computational Complexity Boot Camp
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
808
Likes
14
Duration
01:00:05
Published
Aug 22, 2018
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.