The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ic.2009.03.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IC.2009.03.001 / rank | |||
Normal rank | |||
Latest revision as of 14:27, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions |
scientific article |
Statements
The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (English)
0 references
27 November 2009
0 references
Unique-3-TRP
0 references
Unique-2-TRP
0 references
randomized reductions
0 references
0 references
