Add

exams/2022_05_30/03.tex

@@ -77,7 +77,7 @@ \subsection{Exam: 2022. 05. 30., Exercise 3}
 \hline
 \makecell[l]{SAT($\Phi$)} & \makecell[l]{Given the $\Phi$ boolean formula, can it be\\ satisfied, e.g. is there an assigment of the variables in it\\ for which the formula evaluates to true?} \\
 \hline
-\makecell[l]{3-SAT($\Phi$),\\4-SAT($\Phi$),\\\dots{},\\n-SAT($\Phi$), where $n\geq{}3$} & \makecell[l]{Given a ($\Phi$) formula of Boolean-variables,\\ which is specifically in \href{https://en.wikipedia.org/wiki/Disjunctive_normal_form}{disjunctive normal form},\\ where a term consists of exactly $n$ variables,\\ can this formula be satisfied?\\ Be careful, 2-SAT is in P!} \\
+\makecell[l]{3-SAT($\Phi$),\\4-SAT($\Phi$),\\\dots{},\\n-SAT($\Phi$), where $n\geq{}3$} & \makecell[l]{Given a ($\Phi$) formula of Boolean-variables,\\ which is specifically in \href{https://en.wikipedia.org/wiki/Conjunctive_normal_form}{conjunctive normal form},\\ where a term consists of exactly $n$ variables,\\ can this formula be satisfied?\\ Be careful, 2-SAT is in P!} \\
 \hline
 \hline
 \makecell[l]{MAXINDEP(G, k)} & \makecell[l]{Is there a set of independent vertices of size (at least) $k$ in $G$?} \\