The game total domination problem is log-complete in PSPACE (Q2361492)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The game total domination problem is log-complete in PSPACE |
scientific article |
Statements
The game total domination problem is log-complete in PSPACE (English)
0 references
30 June 2017
0 references
total domination game
0 references
computational complexity
0 references
PSPACE-complete problems
0 references
POS-CNF problem
0 references
0 references
