Probabilistic weak simulation is decidable in polynomial time (Q1029062)
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: Probabilistic weak simulation is decidable in polynomial time |
scientific article; zbMATH DE number 5576931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic weak simulation is decidable in polynomial time |
scientific article; zbMATH DE number 5576931 |
Statements
Probabilistic weak simulation is decidable in polynomial time (English)
0 references
9 July 2009
0 references
algorithms
0 references
computational complexity
0 references
Markov chains
0 references
performance evaluation
0 references
simulation preorder
0 references
0.90430844
0 references
0.86341655
0 references
0.86222905
0 references
0.8501746
0 references
0.84694165
0 references
0.84493816
0 references
0.84485894
0 references
0.8445889
0 references
0.8422537
0 references
