Small tweak to S.3.

mult_distinct_p.tex

@@ -80,7 +80,7 @@ Note that this implies that $\poly_{G}^\kElem$ is indeed a $1$-\abbrTIDB lineage
 
 Next, we note that the runtime for answering $\qhard^k$ on deterministic database $\tupset$, as defined above, is $O_k\inparen{\numedge}$ (i.e. deterministic query processing is `easy' for this query):
 \begin{Lemma}\label{lem:tdet-om}
-For $\qhard^k,\tupset$ be as above, 
+For $\qhard^k,\tupset$ defined as above, 
 $\qruntimenoopt{\qhard^k, \tupset, \bound}$ is $O_k\inparen{\numedge}$.
 \end{Lemma}