Constructive Algorithm for Matroid Pathwidth

Published on ● Video Link: https://www.youtube.com/watch?v=I1wBMbpDCxU



Duration: 31:02
482 views
4


Eunjung Kim, CNRS/Paris Dauphine University
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
https://simons.berkeley.edu/talks/eunjung-kim-2015-11-05







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