Pages that link to "Item:Q1978020"
From MaRDI portal
The following pages link to Strong bounds on the approximability of two Pspace-hard problems in propositional planning (Q1978020):
Displaying 4 items.
- The computational complexity of propositional STRIPS planning (Q1337679) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- Computational Complexity of Computing Symmetries in Finite-Domain Planning (Q5856495) (← links)