Stochastic processes with expected stopping time
From MaRDI portal
Cites work
- A course in game theory.
- Graph planning with expected finite horizon
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 4122048 (Why is no real title available?)
- scientific article; zbMATH DE number 1439861 (Why is no real title available?)
- scientific article; zbMATH DE number 3240812 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- On the Complexity of Value Iteration
- On the undecidability of probabilistic planning and related stochastic optimization problems
- Positivity of second order linear recurrent sequences
- Positivity problems for low-order linear recurrence sequences
- Probabilistic automata
- Probabilistic ω-automata
- Reachability problems for Markov chains
- Stochastic processes. Theory for applications.
- The Complexity of Markov Decision Processes
- The complexity of probabilistic verification
This page was built for publication: Stochastic processes with expected stopping time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034618)