[TI] Fixes

semester3/ti-compact/parts/05_complexity.tex

@@ -181,3 +181,5 @@ A few languages commonly used to show $NP$-completeness:
 \end{itemize}
 where a clique is \TODO Add.
 and a vertex cover is any set $U \subseteq V$ where all edges $\{ u, v \} \in E$ have at least one endpoint $u, v \in U$
+
+We have $SAT \leq_p \text{CLIQUE}$, $SAT \leq 3SAT$, $\text{CLIQUE} \leq VC$