ETH Hardness for Densest-k-Subgraph with Perfect Completeness

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


Duration: 18:18
531 views
4

Aviad Rubinstein, UC Berkeley
Computational Complexity of Low-Polynomial Time Problems
https://simons.berkeley.edu/talks/aviad-rubinstein-2015-12-03



Other Videos By Simons Institute for the Theory of Computing


2015-12-08Optimal Data-Dependent Hashing for Nearest Neighbor Search
2015-12-08Simulating Branching Programs with Edit Distance and Friends
2015-12-08Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
2015-12-08Upper and Lower Bounds for Graph Problems in Computer Aided Verification
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-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


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Fine-Grained Complexity and Algorithm Design
Aviad Rubinstein