summaryrefslogtreecommitdiffstats
path: root/chapters/dynamization.tex
diff options
context:
space:
mode:
Diffstat (limited to 'chapters/dynamization.tex')
-rw-r--r--chapters/dynamization.tex1
1 files changed, 1 insertions, 0 deletions
diff --git a/chapters/dynamization.tex b/chapters/dynamization.tex
index c21bfbc..0ee77d3 100644
--- a/chapters/dynamization.tex
+++ b/chapters/dynamization.tex
@@ -625,6 +625,7 @@ decomposable}. These are decomposable search problems for which the
underlying data structure supports a delete operation. More formally,
\begin{definition}[Deletion Decomposable Search Problem~\cite{merge-dsp}]
+ \label{def:background-ddsp}
A decomposable search problem, $F$, and its data structure,
$\mathcal{I}$, is deletion decomposable if and only if, for some
instance $\mathscr{I} \in \mathcal{I}$, containing $n$ records,