Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126)
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 7152248
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing binary shuffle squares is \textsf{NP}-hard |
scientific article; zbMATH DE number 7152248 |
Statements
Recognizing binary shuffle squares is \textsf{NP}-hard (English)
0 references
16 January 2020
0 references
strings
0 references
shuffle product
0 references
binary alphabets
0 references
NP-hardness
0 references
0 references
0.88206946849823
0 references
0.8593456745147705
0 references
0.788524866104126
0 references
0.7605298161506653
0 references
0.759253203868866
0 references
