Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars

Details Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars

2012-01-11

arxiv.org/abs/1201.2374v1

Computer Science

Computational Complexity

Scientific paper

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.) We use this result to resolve several open problems regarding the computational complexity of computing key quantities associated with some classic and heavily studied stochastic processes, including multi-type branching processes and stochastic context-free grammars.

Affiliated with

Also associated with

No associations

Rating

Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-604628