Pages that link to "Item:Q3457753"
From MaRDI portal
The following pages link to Complexity of finite-horizon Markov decision process problems (Q3457753):
Displayed 14 items.
- Hybrid answer set programming (Q392277) (← links)
- On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
- On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
- Approximate receding horizon approach for Markov decision processes: average reward case (Q1414220) (← links)
- On the computability of Solomonoff induction and AIXI (Q1704559) (← links)
- A mean-variance optimization problem for discounted Markov decision processes (Q1926755) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- POMDPs under probabilistic semantics (Q2344358) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Temporal concatenation for Markov decision processes (Q5051192) (← links)
- On the Complexity of Value Iteration (Q5091264) (← links)
- I <scp>ndemics</scp> (Q5176913) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Approximability and efficient algorithms for constrained fixed-horizon POMDPs with durative actions (Q6080639) (← links)