wiki_research

commit b6facdc46f11bcb3575ad6b372cfd34ae1d9c7cb
parent 00c74fa1a87db73fcbd9ff7b1b3788e46df1c14b
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Wed, 21 Oct 2026 18:11:58 +0200

commit with codex

Diffstat:
shuffle_product_problem
 | 
2
+-

1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/shuffle_product_problem b/shuffle_product_problem
@@ -4,7 +4,7 @@ The [computational_problem], given [words] s1, ..., sk, and t, of [deciding] whe
 
 can be done with [dynamic_programming], which gives a [polynomial_time] [algorithm] if k is a constant
 
-is [NP_hard] for unbounded k
+is [NP_hard] for unbounded k, in [warmuth1984complexity]
 - see Problem 3 in [giraudo2016unshuffling]
 
 [complete] for [XNLP], cf [bodlaender2026parameterized]