The Guarding Problem – Complexity and Approximation (Q3651572)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Guarding Problem – Complexity and Approximation |
scientific article |
Statements
The Guarding Problem – Complexity and Approximation (English)
0 references
11 December 2009
0 references
approximation algorithms
0 references
PSPACE-complete
0 references
QBF
0 references
quantified Boolean formula)
0 references
QSAT
0 references
quantified satisfiability
0 references
cops region
0 references
robber region
0 references
