Recognizing binary shuffle squares is NP-hard

Laurent Bulteau, Stéphane Vialette. Recognizing binary shuffle squares is NP-hard. Theoretical Computer Science, 806:116-132, 2020. [doi]

Authors

Laurent Bulteau

This author has not been identified. Look up 'Laurent Bulteau' in Google

Stéphane Vialette

This author has not been identified. Look up 'Stéphane Vialette' in Google