Probabilistic weak simulation is decidable in polynomial time (Q1029062): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2003.10.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006889545 / rank | |||
Normal rank | |||
Revision as of 01:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic weak simulation is decidable in polynomial time |
scientific article |
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
