On the Complexity of Two Dots for Narrow Boards and Few Colors. (Q3305725): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
label / en | label / en | ||
On the Complexity of Two Dots for Narrow Boards and Few Colors. | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: TETRIS IS HARD, EVEN TO APPROXIMATE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single-Player and Two-Player Buttons & Scissors Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants'' / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5282816 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3395518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2831399 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two Dots is NP-complete / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09: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