Unshuffling a square is NP-hard (Q2637646): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1211.7161 / rank | |||
Normal rank | |||
Revision as of 07:35, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unshuffling a square is NP-hard |
scientific article |
Statements
Unshuffling a square is NP-hard (English)
0 references
13 February 2014
0 references
square shuffle
0 references
NP-completeness
0 references
