Pages that link to "Item:Q2353405"
From MaRDI portal
The following pages link to A complete parameterized complexity analysis of bounded planning (Q2353405):
Displaying 7 items.
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- A framework for analysing state-abstraction methods (Q2060741) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Backdoors to planning (Q2321271) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
