103 citations · 136 across the 6 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 7 cited
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak +1
The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the…
cs.AI2012
The Complexity of Planning Revisited - A Parameterized Analysis
Christer Baeckstroem, Yue Chen, Peter Jonsson +2
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (Baeckstroem and Nebel) have influenced following res…