From Channel Assignment to Subgraph Isomorphism

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


Duration: 17:28
673 views
2

Arkadiusz Socała, University of Warsaw
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
https://simons.berkeley.edu/talks/channel-assignment-subgraph-isomorphism



Other Videos By Simons Institute for the Theory of Computing


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-10An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
2015-11-10Improved Deterministic Algorithms for Sparse Max-SAT
2015-11-10Towards General and Tight Hardness Results for Graph Problems
2015-11-10Faster Satisfiability Algorithms for Systems of Polynomial Equations over Finite Fields and ACC^0[p]
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
2015-10-19Non-Revelation Mechanism Design: Inference, Optimization, and Approximation


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Fine-Grained Complexity and Algorithm Design
Arkadiusz Socała