The following pages link to Christer Bäckström (Q234896):
Displayed 24 items.
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- Tractable plan existence does not imply tractable plan generation (Q1267773) (← links)
- A unifying approach to temporal constraint reasoning (Q1274294) (← links)
- Computational complexity of relating time points with intervals (Q1292318) (← links)
- On the computational complexity of temporal projection, planning, and plan validation (Q1321058) (← links)
- Item:Q234896 (redirect page) (← links)
- Towards efficient universal planning: A randomized approach (Q1978311) (← links)
- A framework for analysing state-abstraction methods (Q2060741) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond (Q2842195) (← links)
- Algorithms and Limits for Compact Plan Representations (Q2905381) (← links)
- Automaton Plans (Q2922398) (← links)
- (Q3457201) (← links)
- (Q3457202) (← links)
- (Q4012203) (← links)
- (Q4215782) (← links)
- Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis (Q4576174) (← links)
- Upper and Lower Time and Space Bounds for Planning (Q4576203) (← links)
- Time and Space Bounds for Planning (Q4596722) (← links)
- Parameterized Complexity and Kernel Bounds for Hard Planning Problems (Q4924634) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- (Q5282951) (← links)
- Electronic editor: Automatic content-based sequential compilation of newspaper articles (Q5957999) (← links)