Definition
3-Satisfiability Problem
The 3-SAT problem is a specific form of the SAT where every clause consists of exactly 3 literals, where every literal is bound to a different variable.
Example:
3-Satisfiability Problem
The 3-SAT problem is a specific form of the SAT where every clause consists of exactly 3 literals, where every literal is bound to a different variable.
Example: