Pages that link to "Item:Q1730016"
From MaRDI portal
The following pages link to \textsc{Hanano} puzzle is \textsf{NP}-hard (Q1730016):
Displaying 5 items.
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle (Q2672240) (← links)
- On the complexity of jelly-no-puzzle (Q2695482) (← links)
- Defying gravity and gadget numerosity: the complexity of the Hanano puzzle (Q6175086) (← links)
- Defying gravity and gadget numerosity: the complexity of the Hanano puzzle and beyond (Q6602331) (← links)