Pages that link to "Item:Q1170032"

The following pages link to On the computational complexity of a merge recognition problem (Q1170032):

Displaying 9 items.

• Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
• Reconstructing a history of recombinations from a set of sequences (Q1281773) (← 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)
• Unshuffling a square is NP-hard (Q2637646) (← links)
• On recognising words that are squares for the shuffle product (Q2699216) (← links)
• The Shuffle Product: New Research Directions (Q2799163) (← links)
• (Q5002800) (← links)