shuffle_product_problem (350B)
1 # Shuffle product problem 2 3 The [computational_problem], given [words] s1, ..., sk, and t, of [deciding] whether t is in the [shuffle] of s1, ..., sk 4 5 can be done with [dynamic_programming], which gives a [polynomial_time] [algorithm] if k is a constant 6 7 [complete] for [XNLP], cf [bodlaender2026parameterized] 8 9 Up: [computational_problem], [shuffle]