A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars |
scientific article; zbMATH DE number 6329875
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars |
scientific article; zbMATH DE number 6329875 |
Statements
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (English)
0 references
13 August 2014
0 references
strongly polynomial algorithm
0 references
branching processes
0 references
stochastic context-free grammars
0 references
exact matrix computations
0 references
0 references
0 references
0.9390056
0 references
0.88655424
0 references
0.8659938
0 references
0.8589519
0 references
0.8551507
0 references
0.85155946
0 references
0.8478441
0 references
