Fully polynomial-time computation of maximum likelihood trajectories in Markov chains (Q344537)
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: Fully polynomial-time computation of maximum likelihood trajectories in Markov chains |
scientific article; zbMATH DE number 6655347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully polynomial-time computation of maximum likelihood trajectories in Markov chains |
scientific article; zbMATH DE number 6655347 |
Statements
Fully polynomial-time computation of maximum likelihood trajectories in Markov chains (English)
0 references
23 November 2016
0 references
Markov chains
0 references
graph algorithms
0 references
computational complexity
0 references
0.7179043889045715
0 references
0.7088842391967773
0 references
0.7005665898323059
0 references
