Unshuffling a square is NP-hard (Q2637646)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6257466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unshuffling a square is NP-hard |
scientific article; zbMATH DE number 6257466 |
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
0.8593456745147705
0 references
0.8033158183097839
0 references
0.7616039514541626
0 references
0.747963547706604
0 references
0.7462572455406189
0 references
