3-CNF-Satifiability

• Input: A Boolean formula F with at most 3 literals per clause.

• Output: Determine if F is satisfiable.

• 3-CNF-Satisfiability is NP-complete

  • This is probably the most used NP-complete problem in reduction proofs showing other decision problems are NP-hard.

Previous slide

Next slide

Back to first slide

View graphic version