Pages that link to "Item:Q3113763"
From MaRDI portal
The following pages link to COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS (Q3113763):
Displaying 13 items.
- Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited (Q527403) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Probabilistic algorithm for finding roots of linearized polynomials (Q1008961) (← links)
- A linear algorithm to solve fixed-point equations on transition systems (Q1115196) (← links)
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs (Q2260413) (← links)
- Convergence Thresholds of Newton's Method for Monotone Polynomial Equations (Q4910727) (← links)
- (Q5020647) (← links)
- (Q5129945) (← links)
- A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381) (← links)
- Certificates for probabilistic pushdown automata via optimistic value iteration (Q6536144) (← links)
