Lower Bounds for Problems Parameterized by Clique-width

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


Duration: 25:26
359 views
1

Petr Golovach, University of Bergen
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
https://simons.berkeley.edu/talks/petr-golovach-2015-11-06



Other Videos By Simons Institute for the Theory of Computing


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
2015-11-10Constructive Algorithm for Matroid Pathwidth
2015-11-10Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
2015-11-10Engineering Motif Search for Large Graphs
2015-11-10Lower Bounds on the Space Complexity of Dynamic Programming
2015-11-10Lower Bounds for Problems Parameterized by Clique-width
2015-11-10From Channel Assignment to Subgraph Isomorphism
2015-10-19Computational Efficiency Requires Simple Taxation
2015-10-19The Sample Complexity of Revenue Maximization
2015-10-19Multi-dimensional Virtual Values and Second-degree Price Discrimination
2015-10-19Smoothness and Pricing: Near-Optimal Outcomes in Markets Large and Small
2015-10-19How Well Do Prices Coordinate Markets
2015-10-19The Substitution Metric and the Performance of Clock Auctions
2015-10-19Decision Making at Scale: Algorithms, Mechanisms, and Platforms
2015-10-19On Maximizing Revenue for Multi-Item Auctions
2015-10-19Complexity in AGT Update: Nash Approximability and Simultaneous Auctions


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