Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard (Q3088169): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-22670-0_1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W196900508 / rank | |||
Normal rank | |||
Revision as of 22:24, 19 March 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
