Unshuffling a square is NP-hard (Q2637646)
From MaRDI portal
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
0 references
0 references
