updated section 6 - intro and section 6.2

metrics.tex

@@ -67,7 +67,7 @@ \subsection{NP-Hardness of the Max Quality Pipeline Instantiation Process}\label
 \end{definition}
 
 The Max Quality \problem is a combinatorial selection problem and is NP-hard, as stated by the following theorem.
-Note that while the overall problem is NP-hard, there is a component of the problem that is solvable in polynomial time: matching the profile of each service with the node policy. This can be done by iterating over each node and each service, checking if the service matches the node’s policy. This process would take $O(|N|*|S|)$ time. This is polynomial time complexity.
+However, while the overall problem is NP-hard, there is a component of the problem that is solvable in polynomial time: matching the profile of each service with the node policy. This can be done by iterating over each node and each service, checking if the service matches the node’s policy. This process would take $O(|N|*|S|)$ time. This is polynomial time complexity.
 
 \begin{theorem}
   The Max Quality  \problem is NP-Hard.