Pages that link to "Item:Q1749534"
From MaRDI portal
The following pages link to Algorithmic and algebraic aspects of unshuffling permutations (Q1749534):
Displaying 4 items.
- An algebraic approach for the search space of permutations with repetition (Q2057112) (← links)
- Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- The lengths for which bicrucial square-free permutations exist (Q6156001) (← links)