Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems

Agustín Bompadre. Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems. Algorithmica, 62(3-4):659-700, 2012. [doi]

Abstract

Abstract is missing.