wiki_research

commit 2165daa6e343ee6a4a47d1e582b6c761b659d4d3
parent 6f022cdba450d276d56d9883b62c840e3e0ae1f5
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Tue,  4 Feb 2025 00:22:40 +0100

commit with codex

Diffstat:
enumeration
 | 
1
+
gray_code
 | 
6
+++++-
nptime
 | 
2
++
ptime
 | 
2
++

4 files changed, 10 insertions(+), 1 deletion(-)
diff --git a/enumeration b/enumeration
@@ -8,6 +8,7 @@ https://en.wikipedia.org/wiki/Enumeration_algorithm
 - [enumeration_complexity]
 - [enumeration_related_work]
 - [enumeration_open_problems]
+- [enumeration_algorithms]
 
 ## Related problems
 
diff --git a/gray_code b/gray_code
@@ -1,12 +1,16 @@
 # Gray code
 
 - [mutze2022combinatorial]: [survey_paper]
-  - avoiding a given [subword], cf [squire1996gray] and references from above survey
+  - avoiding a given [subword]
+    - cf [squire1996gray] and references from [mutze2022combinatorial]
     - cf [minimal_absent_word]
 - older survey: [savage1997survey]
 
 - [shuffle_exchange_network] [feldmann1996shuffle]
 
+construction:
+- [reflected_binary_code]
+
 Up: [enumeration]
 
 See also: [middle_levels_conjecture], [torsten]
diff --git a/nptime b/nptime
@@ -15,3 +15,5 @@ subset [up]
 Up: [complexity_class]
 
 See also: [ptime], [np_complete], [np_hard], [np_cap_conp], [conp], [nondeterministic_PTIME_Turing_machine]
+
+Aliases: NP
diff --git a/ptime b/ptime
@@ -12,3 +12,5 @@ When the input consists of integers, we distinguish: https://en.wikipedia.org/wi
 Up: [complexity_class]
 
 See also: [pseudo_polynomial_time], [quasipolynomial], [oplusp], [ptime_reduction]
+
+Aliases: P