Complexity of chess domination problems (Q7015863)
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 8006015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of chess domination problems |
scientific article; zbMATH DE number 8006015 |
Statements
Complexity of chess domination problems (English)
0 references
7 March 2025
0 references
art gallery theorem
0 references
NP-completion
0 references
NP-hardness
0 references
polyomino
0 references
computational geometry
0 references
visibility coverage
0 references
guard number
0 references
domination problem
0 references
\(N\)-queens problem
0 references
linear programming
0 references
0 references
0 references
0 references
0 references
