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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.