commit 0745ea20ab4130a50ff08cd27a7dac1ff507b6bb
parent d40187228225de450c82d92d4c59a822de1d491f
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Mon, 28 Apr 2025 16:30:50 +0200
commit with codex
Diffstat:
4 files changed, 15 insertions(+), 0 deletions(-)
diff --git a/complexity_space b/complexity_space
@@ -3,7 +3,10 @@
- [savitchs_theorem]: we can simulate [nondeterministic] machine with [quadratic] blowup in space
- [catalytic_space]
+- [enumeration_memory]
Up: [complexity_measure]
See also: [complexity_time]
+
+Aliases: space complexity
diff --git a/enumeration_constant_memory b/enumeration_constant_memory
@@ -0,0 +1,9 @@
+# Enumeration constant memory
+
+An [enumeration_algorithm] where [space_complexity] remains constant throughout the [enumeration_phase]
+
+Up: [enumeration_memory]
+
+Aliases: constant memory enumeration
+
+See also: [Constant_delay], [constant_time]
diff --git a/enumeration_definition b/enumeration_definition
@@ -6,4 +6,6 @@ An [enumeration_algorithm] consists of two phases:
To solve an [enumeration_problem]
+[enumeration_memory]
+
Up: [enumeration]
diff --git a/enumeration_tasks b/enumeration_tasks
@@ -17,6 +17,7 @@
- [enumeration_spanner]
- [enumeration_graphs]
- [enumeration_paths]
+ - [enumeration_leaves]
- [enumeration_homomorphisms] ([christoph_berkholz])
- [enumeration_csp] ([christoph_berkholz])
- [enumeration_topological_sort]
