Lower Bound Issues in Computational Social Choice

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



Duration: 58:20
404 views
4


Rolf Niedermeier, TU Berlin
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
https://simons.berkeley.edu/talks/tbd-0







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