Understanding the Computational Complexity of Polynomial-Time Problems π
Explore the fundamentals of computational complexity in polynomial-time problems with Virginia Vassilevska Williams at Stanford. Perfect for algorithm enthusiasts aiming to deepen their understanding of fine-grained complexity and problem-solving techniqu

Simons Institute for the Theory of Computing
3.1K views β’ Sep 9, 2015

About this video
Virginia Vassilevska Williams, Stanford University
Fine-Grained Complexity and Algorithm Design Boot Camp
http://simons.berkeley.edu/talks/virginia-williams-2015-09-01
Fine-Grained Complexity and Algorithm Design Boot Camp
http://simons.berkeley.edu/talks/virginia-williams-2015-09-01
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
3.1K
Likes
19
Duration
01:07:17
Published
Sep 9, 2015
User Reviews
4.1
(3) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
No specific trending topics match this video yet.
Explore All Trends