diff options
| author | Douglas Rumbaugh <dbr4@psu.edu> | 2025-05-16 16:02:33 -0400 |
|---|---|---|
| committer | Douglas Rumbaugh <dbr4@psu.edu> | 2025-05-16 16:02:33 -0400 |
| commit | 9b896766ea5feeb3c80866a4dabde75565a43398 (patch) | |
| tree | 9d982a4c271d846997ba20d688a114813da43bbb /chapters/dynamization.tex | |
| parent | 4ef9fd87af544c9546573e26d1f58c5590879424 (diff) | |
| download | dissertation-9b896766ea5feeb3c80866a4dabde75565a43398.tar.gz | |
updates
Diffstat (limited to 'chapters/dynamization.tex')
| -rw-r--r-- | chapters/dynamization.tex | 1 |
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, |