The Square Root Phenomenon in Planar Graphs -- Survey and New Results

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


Duration: 1:06:23
231 views
1

Dániel Marx, Hungarian Academy of Sciences
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
https://simons.berkeley.edu/talks/daniel-marx-2015-11-06



Other Videos By Simons Institute for the Theory of Computing


2015-11-20Strong Truthfulness in Multi-signal Peer Prediction with Overlapping Tasks
2015-11-20The State of Techniques for Solving Large Imperfect-Information Games
2015-11-20An Evolutionary Model of Economic Behavior, Bounded Rationality, and Intelligence
2015-11-20The Design of Financial Exchanges: Some Open Questions at the Intersection of Econ and CS
2015-11-20Robust Inference for Games via Theoretical Guarantees
2015-11-20Security Games: Key Algorithmic Principles, Deployed Applications and Research Challenges(*)
2015-11-20Algorithmic Trading and Machine Learning
2015-11-20Informational Substitutes and Complements for Prediction
2015-11-20Incentive Auctions and Spectrum Repacking
2015-11-13Research Challenges in Designing the US Incentive Auction
2015-11-10The Square Root Phenomenon in Planar Graphs -- Survey and New Results
2015-11-10Parameterized and Promised Streaming
2015-11-10Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reduc
2015-11-10Fine-Grained Complexity of Exact Algorithms
2015-11-10More Needles in the Hay Might Make it Harder to Find One?
2015-11-10Fine-Grained Counting Complexity I
2015-11-10New Unconditional Lower Bounds for Algorithms and Enumeration Problems
2015-11-10Dense Subset Sum May Be the Hardest
2015-11-10Parameterized Inapproximability of Max k-Subset Intersection under ETH
2015-11-10Lower Bound Results for Hard Problems Related to Finite Automata
2015-11-10Spotting Trees with Few Leaves


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Fine-Grained Complexity and Algorithm Design
Dániel Marx