Pages that link to "Item:Q3177734"
From MaRDI portal
The following pages link to Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (Q3177734):
Displaying 6 items.
- Shortest Paths in One-Counter Systems (Q2811358) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
- A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381) (← links)
- Efficient Analysis of Probabilistic Programs with an Unbounded Counter (Q5501946) (← links)
- Model Checking Temporal Properties of Recursive Probabilistic Programs (Q6137848) (← links)
- Certificates for probabilistic pushdown automata via optimistic value iteration (Q6536144) (← links)
