Lower Bounds on Pure Dynamic Programming for Connectivity Problems on Graphs of Bounded Path-Width.

Kacper Kluk, Jesper Nederlof

Browse the full ICALP paper archive.