Pages that link to "Item:Q504223"
From MaRDI portal
The following pages link to Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223):
Displaying 4 items.
- On the computational complexity of temporal projection, planning, and plan validation (Q1321058) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Complexity of qualitative timeline-based planning (Q6060102) (← links)