Fine-Grained Counting Complexity I

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


Duration: 1:02:04
453 views
2

Holger Dell, Universität des Saarlandes
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
https://simons.berkeley.edu/talks/holger-dell-2015-11-03



Other Videos By Simons Institute for the Theory of Computing


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-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
2015-11-10Color Coding-Related Techniques
2015-11-10Fine-Grained Counting Complexity II
2015-11-10Subexponential Parameterized Complexity of Completion Problems: Survey of the Upper Bounds
2015-11-10Lower Bounds for Subexponential Parameterized Complexity of Minimum Fill-in and Related Problems
2015-11-10Lossy Kernelization


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