\textsc{Hanano} puzzle is \textsf{NP}-hard (Q1730016)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \textsc{Hanano} puzzle is \textsf{NP}-hard |
scientific article; zbMATH DE number 7033881
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \textsc{Hanano} puzzle is \textsf{NP}-hard |
scientific article; zbMATH DE number 7033881 |
Statements
\textsc{Hanano} puzzle is \textsf{NP}-hard (English)
0 references
11 March 2019
0 references
combinatorial puzzles
0 references
computational complexity
0 references
Hanano puzzle
0 references
NP-hardness
0 references
