Pages that link to "Item:Q2285126"
From MaRDI portal
The following pages link to Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126):
Displaying 6 items.
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Unshuffling permutations: trivial bijections and compositions (Q2327475) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- On shuffled-square-free words (Q2680851) (← links)
- Subsequence covers of words (Q6166966) (← links)
- Shuffle squares and reverse shuffle squares (Q6189690) (← links)