Talks Fall 2015 Fine-Grained Complexity of Exact Algorithms Monday, November 2nd, 2015, 9:30 am–10:30 am Add to CalendariCalendar Outlook Google Event: Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms Speaker: Fedor Fomin, University of BergenWe discuss lower and upper bounds on exact algorithms for different graph problems. Download Video [2.0GB .mp4]
