Unshuffling Permutations
From MaRDI portal
Publication:2802964
DOI10.1007/978-3-662-49529-2_38zbMath1412.68160arXiv1601.05962OpenAlexW3038043012MaRDI QIDQ2802964
Samuele Giraudo, Stéphane Vialette
Publication date: 3 May 2016
Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.05962
Combinatorics in computer science (68R05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Algorithmic and algebraic aspects of unshuffling permutations ⋮ Recognizing binary shuffle squares is \textsf{NP}-hard
This page was built for publication: Unshuffling Permutations
