Talks
Fall 2015

Lower Bound Issues in Computational Social Choice

Tuesday, November 3rd, 2015, 2:00 pm–3:00 pm

Add to Calendar

Event: 
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
Speaker: 

Rolf Niedermeier, TU Berlin

We discuss several challenges concerning (missing) lower bounds for fixed-parameter tractability results for problems arising in voting and related areas.

Download Video [2.1GB .mp4]
AttachmentSize
PDF icon Lower Bound Issues in Computational Social Choice710.55 KB
PDF icon Lower Bound Issues in Computational Social Choice Animated887.44 KB