From the Inside: Fine-Grained Complexity and Algorithm Design

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=IlE-TyXWXpI


Duration: 5:22
978 views
16

Christos Papadimitriou and Russell Impagliazzo discuss the Fall 2015 program on Fine-Grained Complexity and Algorithm Design.

https://simons.berkeley.edu/programs/complexity2015



Other Videos By Simons Institute for the Theory of Computing


2015-12-08Deterministic APSP, Orthogonal Vectors, and More
2015-12-08Some Emergency Barriers to Worst-Case Dynamic MST
2015-12-08Input Sparsity and Hardness for Linear Algebra Problems
2015-12-08Deterministic Edge Connectivity in Near-Linear Time
2015-12-08Finding k Simple Shortest Paths and Cycles
2015-12-08Light Spanners
2015-12-08Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
2015-12-08Subquadratic Algorithms for Succinct Stable Matching
2015-12-08Orthogonal Vectors is Hard for First-Order Properties on Sparse Graphs
2015-12-08ETH Hardness for Densest-k-Subgraph with Perfect Completeness
2015-12-08From the Inside: Fine-Grained Complexity and Algorithm Design
2015-12-08From the Inside: Economics and Computation
2015-11-20Bitcoin's Incentive Structure
2015-11-20Dynamic Pricing in Ride-Sharing Platforms
2015-11-20AGT and Machine Learning
2015-11-20Business Model Analysis
2015-11-20The Limits of Reputation in Platform Markets
2015-11-20Outsourcing Tasks Online: Matching Supply and Demand on Peer-to-Peer Internet
2015-11-20Kidney Exchange: Algorithms and Incentives
2015-11-20Designing Online Advertising Markets
2015-11-20Online Advertisements and Online Algorithms


Tags:
Simons Institute
theory of computing
computer science
uc berkeley
computational complexity
algorithm design
Christos Papadimitriou
Russell Impagliazzo