On the Complexity of Two Dots for Narrow Boards and Few Colors. (Q3305725): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
On the Complexity of Two Dots for Narrow Boards and Few Colors. | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://dblp.uni-trier.de/db/conf/fun/fun2018.html#BiloG0M18 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2811134410 / rank | |||
Normal rank | |||
| Property / title | |||
On the Complexity of Two Dots for Narrow Boards and Few Colors. (English) | |||
| Property / title: On the Complexity of Two Dots for Narrow Boards and Few Colors. (English) / rank | |||
Normal rank | |||
Latest revision as of 08:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Two Dots for Narrow Boards and Few Colors. |
scientific article |
Statements
11 August 2020
0 references
puzzle
0 references
NP-completeness
0 references
perfect information
0 references
combinatorial game theory
0 references
0 references
On the Complexity of Two Dots for Narrow Boards and Few Colors. (English)
0 references
