COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
From MaRDI portal
Publication:3113763
DOI10.4230/LIPIcs.STACS.2010.2468zbMath1230.65022MaRDI QIDQ3113763
Andreas Gaiser, Stefan Kiefer, Javier Esparza
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c316.html
65H10: Numerical computation of solutions to systems of equations
65D15: Algorithms for approximation of functions
65Y20: Complexity and performance of numerical algorithms
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Unnamed Item, Unnamed Item, A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes, Space-efficient scheduling of stochastically generated tasks, Derivation tree analysis for accelerated fixed-point computation, Analyzing probabilistic pushdown automata
Uses Software