3CNF SAT Problem is NP complete
A Boolean formula is in conjunctive normal form, or CNF, if it is expressed as conjunctions (by AND) of clauses, each of which is the disjunction (by OR) of one or more literals
In 3-CNF-SAT, we are asked whether a given Boolean formula the φ in 3-CNF-SAT is satisfiable