Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing binary shuffle squares is \textsf{NP}-hard |
scientific article |
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
