On the computational complexity of a game of cops and robbers (Q1945941)
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: On the computational complexity of a game of cops and robbers |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of a game of cops and robbers |
scientific article |
Statements
On the computational complexity of a game of cops and robbers (English)
0 references
17 April 2013
0 references
computational complexity
0 references
cops and robber
0 references
pursuit game
0 references
0.9080703854560852
0 references
0.8839579224586487
0 references
0.8689780235290527
0 references
0.8619982004165649
0 references
0.8599252700805664
0 references
