Which statement correctly describes the computational status of the 3‑SAT decision problem?
Hard
Create a free account to see more questions and build your own quiz.
Get StartedWhich statement correctly describes the computational status of the 3‑SAT decision problem?
Options:
- 3‑SAT is decidable in polynomial time (in P)
- 3‑SAT is NP‑complete
- 3‑SAT is undecidable
- 3‑SAT is co‑NP complete
Correct answer: 3‑SAT is NP‑complete
Explanation: 3‑SAT, the satisfiability problem for CNF formulas with clauses of size ≤3, is NP‑complete; Cook and Levin first proved SAT NP‑complete in 1971, implying 3‑SAT is NP‑complete.
Created . Updated .