Computing Least Fixed Points of Probabilistic Systems of Polynomials

14 years 7 months ago

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

Equations | STACS 2010 | Theoretical Computer Science |

claim paper

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

Comments (0)