Intermediate
Theory of Computation
Q64 / 100
What is a 3-SAT problem?
Correct! Well done.
Incorrect.
The correct answer is B) A satisfiability problem where each clause has exactly three literals — NP-complete and used in many reductions
B
Correct Answer
A satisfiability problem where each clause has exactly three literals — NP-complete and used in many reductions
Explanation
3-SAT is NP-complete (reduced from SAT). Every clause has exactly 3 literals. Many NP-completeness proofs reduce from 3-SAT, making it a fundamental problem in complexity theory.
Progress
64/100