Probabilistic weak simulation is decidable in polynomial time (Q1029062): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57801956, #quickstatements; #temporary_batch_1711574657256 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57801956 / rank | |||
Normal rank | |||
Revision as of 23:00, 27 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
