Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

STACS
2010
Springer

favoriteEmaildiscussreport

140views Theoretical Computer Science» more STACS 2010»

Computing Least Fixed Points of Probabilistic Systems of Polynomials

14 years 5 months ago

Computing Least Fixed Points of Probabilistic Systems of Polynomials

Download www7.in.tum.de

We study systems of equations of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a poly

Javier Esparza, Andreas Gaiser, Stefan Kiefer

Real-time Traffic

Equations | STACS 2010 | Theoretical Computer Science |

claim paper

Related Content

» Computing the Least Fixed Point of Positive Polynomial Systems

» Derivation Tree Analysis for Accelerated FixedPoint Computation

» FixedPoint Definability and Polynomial Time on Chordal Graphs and Line Graphs

» Automatic invariant generation for hybrid systems using ideal fixed points

» Heterogeneous Fixed Points with Application to PointsTo Analysis

» On the convergence of Newtons method for monotone systems of polynomial equations

» Convergence Thresholds of Newtons Method for Monotone Polynomial Equations

» Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs

» Selecting Stars The k Most Representative Skyline Operator

Post Info
More Details (n/a)

Added	14 May 2010
Updated	14 May 2010
Type	Conference
Year	2010
Where	STACS
Authors	Javier Esparza, Andreas Gaiser, Stefan Kiefer

Comments (0)