diff options
author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-11-24 15:47:17 +0100 |
---|---|---|
committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-11-24 15:47:17 +0100 |
commit | d4f94546fd3d43438591b44f04ef15a8aac49a7b (patch) | |
tree | b4852a12f3fca3610157fa0b96873c63ba8341b6 | |
parent | 475dae3f1926db5673e70b08b1f677b6848ce284 (diff) |
Fix wording
-rw-r--r-- | mgr.tex | 8 |
1 files changed, 4 insertions, 4 deletions
@@ -98,9 +98,9 @@ tree. \section{Main result} We will improve on the above method even further showing an algorithm that, -after linear preprocessing of the tree can answer questions in time linearithmic -with respect to the question size. In particular, we eliminate any dependence on -tree size during question answering. +after linear preprocessing of the tree we can answer questions in time +linearithmic with respect to the question size. In particular, we eliminate any +dependence on tree size during question answering. More explicitly, we will show how to solve Problem \ref{mso-query-answering-problem}, with a preprocessing algorithm working in @@ -180,7 +180,7 @@ The rest of our work is organized in the following way: \begin{itemize} \item In Chapter \ref{preliminaries} we introduce definitions and - existing algorithms we will use to arrive at our main result. + known algorithms we will use to arrive at our main result. \begin{itemize} \item In particular, Section \ref{query-answering-problems} serves as a short review of some fundamental algorithms for solving |