The following pages link to Unshuffling a square is NP-hard (Q2637646):
Displaying 15 items.
- Square-free words with square-free self-shuffles (Q405075) (← links)
- Infinite self-shuffling words (Q458277) (← links)
- Square-free shuffles of words (Q496046) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- Algorithmic and algebraic aspects of unshuffling permutations (Q1749534) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126) (← links)
- A formal framework for stringology (Q2295636) (← links)
- On shuffled-square-free words (Q2680851) (← links)
- On recognising words that are squares for the shuffle product (Q2699216) (← links)
- The Shuffle Product: New Research Directions (Q2799163) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- (Q5002800) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- Shuffle squares and reverse shuffle squares (Q6189690) (← links)
