The following pages link to Circuit Complexity of Shuffle (Q2870045):
Displaying 5 items.
- On the complexity of iterated shuffle (Q800086) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- Unshuffling permutations: trivial bijections and compositions (Q2327475) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) (Q4625662) (← links)