Circuit Complexity of Shuffle

DOI10.1007/978-3-642-45278-9_34zbMath1408.68081OpenAlexW2287320187MaRDI QIDQ2870045

Michael Soltys

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_34

zbMATH Keywords

lower boundscircuit complexitystring shuffle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Unshuffling a square is NP-hard ⋮ String shuffle: circuits and graphs

This page was built for publication: Circuit Complexity of Shuffle