Computational complexity of two pencil puzzles: Kurotto and Juosan (Q2695483): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 09:06, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity of two pencil puzzles: Kurotto and Juosan |
scientific article |
Statements
Computational complexity of two pencil puzzles: Kurotto and Juosan (English)
0 references
31 March 2023
0 references
Kurotto
0 references
Juosan
0 references
pencil puzzle
0 references
NP-complete
0 references