A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4067292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markovian trees: Properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving nonlinear matrix equations arising in tree-like stochastic processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Methods for Structured Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4313087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biological Sequence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Least Fixed Point of Positive Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Probabilistic Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking of Recursive Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nash Equilibria and Other Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks with ``back buttons'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extinction Probabilities of Supercritical Decomposable Branching Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Structured Markov Chain Approach to Branching Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's iteration for the extinction probability of a Markovian binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic approach to the extinction probability of branching processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the link between Markovian trees and tree-structured Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for solving stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5727090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching processes in biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5802534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Matrix Analytic Methods in Stochastic Modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3527019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:45, 14 July 2024

scientific article; zbMATH DE number 6786784
Language Label Description Also known as
English
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes
scientific article; zbMATH DE number 6786784

    Statements

    A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (English)
    0 references
    0 references
    0 references
    0 references
    6 October 2017
    0 references
    multitype branching processes
    0 references
    extinction probabilities
    0 references
    polynomial-time algorithms
    0 references
    nonlinear systems of equations
    0 references
    Newton's method
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references