Abstract
We show that Shuffle(x,y,w), the problem of determining whether a string w can be composed from an order preserving shuffle of strings x and y, is not in AC 0, but it is in AC 1. The fact that shuffle is not in AC 0 is shown by a reduction of parity to shuffle and invoking the seminal result [FSS84, while the fact that it is in AC 1 is implicit in the results of [Man82a]. Together, the two results provide a strong complexity bound for this combinatorial problem. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Soltys, M. (2013). Circuit complexity of shuffle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8288 LNCS, pp. 402–411). https://doi.org/10.1007/978-3-642-45278-9_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
