wiki_research

commit 3d214362d86ad81501b131ca967f203396010cd6
parent 35aebdd11647577ebbb36a96381c6c7c6718f0af
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Wed, 10 Jun 2026 11:34:21 +0200

Merge remote-tracking branch 'origin/master'

Diffstat:
computing
 | 
2
+-
query_answer
 | 
1
+
shuffle_product_problem
 | 
9
+++++++++
yaos_principle
 | 
2
++

4 files changed, 13 insertions(+), 1 deletion(-)
diff --git a/computing b/computing
@@ -5,7 +5,7 @@ https://en.wikipedia.org/wiki/Unconventional_computing
 - [distributed_computing]
 - [reversible_computing]
 - [quantum_computing]
-- [dionaea_muscipula_computer]
+- [esoteric_computing]
 
 See also: [computer], [computability], [computing_center]
 
diff --git a/query_answer b/query_answer
@@ -6,6 +6,7 @@ A [tuple] (named in [named_perspective], unnamed in [unnamed_perspective]) of [c
 - [factorized_representation]
 - [tuple_testing]
 - [query_enumeration]
+- [order_query_answers]
 
 Up: [query]
 
diff --git a/shuffle_product_problem b/shuffle_product_problem
@@ -0,0 +1,9 @@
+# Shuffle product problem
+
+The [computational_problem], given [words] s1, ..., sk, and t, of [deciding] whether t is in the [shuffle] of s1, ..., sk
+
+can be done with [dynamic_programming], which gives a [polynomial_time] [algorithm] if k is a constant
+
+[complete] for [XNLP], cf [bodlaender2026parameterized]
+
+Up: [computational_problem], [shuffle]
diff --git a/yaos_principle b/yaos_principle
@@ -3,3 +3,5 @@
 https://en.wikipedia.org/wiki/Yao's_principle
 
 Up: [algorithm_randomized]
+
+Aliases: Yao principle, Yao's minmax principle, Yao minmax principle