Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity o ...
['Peter Jonsson', 'Victor Lagerkvist', 'Johannes Schmidt', 'Hannes Uppman']
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis