In: Computer Science
The purpose of this problem is to illustrate how subtle variants of SAT type problems have different levels of difficulty.
Describe a polynomial-time algorithm to solve the following problem (a polynomial-time solution is enough to earn full credit).
Input: A boolean function in CNF such that each clause has exactly three literals.
Output: An assignment of the variables such that each clause has all TRUE literals or all FALSE literals.