The complexity of reachability in randomized sabotage games (Q3400919)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5663811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of reachability in randomized sabotage games |
scientific article; zbMATH DE number 5663811 |
Statements
The Complexity of Reachability in Randomized Sabotage Games (English)
0 references
28 January 2010
0 references
games
0 references
reachability
0 references
probabilistic systems
0 references
fault-tolerant systems
0 references
0.9127339720726012
0 references
0.7862884998321533
0 references
0.7712802886962891
0 references
0.7270787954330444
0 references
