Fine-Grained Complexity of Exact Algorithms

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


Duration: 57:01
782 views
3

Fedor Fomin, University of Bergen
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
https://simons.berkeley.edu/talks/fedor-fomin-2015-11-02



Other Videos By Simons Institute for the Theory of Computing


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-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
2015-11-10Exact Algorithms from FPT Algorithms
2015-11-10Lower Bound Issues in Computational Social Choice
2015-11-10On the Subexponential Time Complexity of the CSP
2015-11-10Lower Bounds on the Running Time for Scheduling and Packing Problems


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