Add to Calendar
- Date:
- Wed, 2011-12-07 13:30
- Location:
- Klaus 1116W, Georgia Tech, Atlanta GA
Abstract:
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/epsilon), where epsilon > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.)
