Understanding the Complexity of Geometric Topology Problems 🧩
Explore the computational challenges in geometric topology with Greg Kuperberg's insightful survey. Discover how complexity theory applies to solving topological puzzles and the implications for mathematics and computer science.
Institute for Advanced Study
616 views • Aug 18, 2016
About this video
Greg Kuperberg
University of California, Davis
September 24, 2012
This talk will be a partial survey of the first questions in the complexity theory of geometric topology problems. What is the complexity, or what are known complexity bounds, for distinguishing n-manifolds for various n? For distinguishing knots? For recognizing a sphere, or the unknot? The survey will be a warmup to my own contribution, which is the fact that knottedness is in NP, assuming the generalized Riemann hypothesis.
For more videos, visit http://video.ias.edu
University of California, Davis
September 24, 2012
This talk will be a partial survey of the first questions in the complexity theory of geometric topology problems. What is the complexity, or what are known complexity bounds, for distinguishing n-manifolds for various n? For distinguishing knots? For recognizing a sphere, or the unknot? The survey will be a warmup to my own contribution, which is the fact that knottedness is in NP, assuming the generalized Riemann hypothesis.
For more videos, visit http://video.ias.edu
Video Information
Views
616
Likes
10
Duration
01:07:01
Published
Aug 18, 2016
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now