COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
From MaRDI portal
Recommendations
- Computing the least fixed point of positive polynomial systems
- A probabilistic approach to polynomial inequalities
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- Probabilistic algorithm for finding roots of linearized polynomials
- Computing invariant sets of random differential equations using polynomial chaos
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- On a probabilistic approach to solving systems of equations with integer-valued unknowns
- Random systems of polynomial equations. The expected number of roots under smooth analysis
- Probabilistic properties of systems of random linear equations over finite algebraic structures
Cited in
(18)- Probabilistic algorithm for finding roots of linearized polynomials
- A linear algorithm to solve fixed-point equations on transition systems
- Analyzing probabilistic pushdown automata
- Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs
- Computing the least fixed point of positive polynomial systems
- Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
- Space-efficient scheduling of stochastically generated tasks
- scientific article; zbMATH DE number 1206053 (Why is no real title available?)
- Convergence thresholds of Newton's method for monotone polynomial equations
- scientific article; zbMATH DE number 7453188 (Why is no real title available?)
- On the termination problem for probabilistic higher-order recursive programs
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited
- A polynomial time algorithm for computing extinction probabilities of multitype branching processes
- Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars
- Derivation tree analysis for accelerated fixed-point computation
- Precise Fixpoint Computation Through Strategy Iteration
- Certificates for probabilistic pushdown automata via optimistic value iteration
This page was built for publication: COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113763)
