A 2cnf-formula is an AND of clauses, where each clause is an OR of at most two

Question:

A 2cnf-formula is an AND of clauses, where each clause is an OR of at most two literals. Let 2SAT = {〈ϕ〉| ϕ is a satisfiable 2cnf-formula}. Show that 2SAT ∈ P.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: