Computational complexity of two pencil puzzles: Kurotto and Juosan (Q2695483): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-90048-9_14 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3210356593 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hashiwokakero is NP-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3395518 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4898148 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3301014 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5405470 / rank | |||
Normal rank | |||
Latest revision as of 20:52, 31 July 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
