From 7f99fac8bd25db9883e916fb2a73a6f9e49f5dd6 Mon Sep 17 00:00:00 2001
From: Marcin Chrzanowski <mc370754@students.mimuw.edu.pl>
Date: Thu, 16 Dec 2021 17:05:15 +0100
Subject: Specify tree needs to be preprocessed

---
 mgr.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/mgr.tex b/mgr.tex
index 0066062..04198e0 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -199,8 +199,8 @@ The rest of our work is organized in the following way:
         \ref{relabel-regular-queries} and solving it.
         \begin{itemize}
             \item Of note, in Section \ref{computing-closure} we show how to
-                compute the LCA closure of a set of $m$ tree vertices in time
-                $O(m \log m)$.
+                compute the LCA closure of a set of $m$ vertices of a
+                preprocessed tree in time $O(m \log m)$.
         \end{itemize}
 \end{itemize}
 
-- 
cgit v1.2.3