Pages that link to "Item:Q814425"
From MaRDI portal
The following pages link to Complexity results for standard benchmark domains in planning (Q814425):
Displaying 14 items.
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- Learning from planner performance (Q835821) (← links)
- The complexity of solitaire (Q1034532) (← links)
- The computational complexity of propositional STRIPS planning (Q1337679) (← links)
- A case study in programming a quantum annealer for hard operational planning problems (Q2018131) (← links)
- Complexity of scorpion solitaire and applications to klondike (Q2235738) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
- Sensor networks and distributed CSP: communication, computation and complexity (Q2457701) (← links)
- Understanding planning tasks. Domain complexity and heuristic decomposition (Q2473931) (← links)
- On the complexity of the storyplan problem (Q6172205) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- Planning in artificial intelligence (Q6602257) (← links)
- On the exploitation of control knowledge for enhancing automated planning (Q6665139) (← links)