On the computational complexity of a game of cops and robbers (Q1945941): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978284948 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1202.6043 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:58, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
