Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard (Q3088169): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-completeness column: An ongoing guide / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph puzzles, homotopy, and the alternating group / rank | |||
Normal rank | |||
Latest revision as of 09:25, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard |
scientific article |
Statements
Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard (English)
0 references
19 August 2011
0 references
NP-completeness
0 references
games' complexity
0 references
computational group theory
0 references
