Computer Sciences > GATE 2014 SET-3 > Complexity Theory
Consider the decision problem 2CNFSAT defined as follows:
{Φ | Φ is a satisfiable propositional formula in CNF with at most two literals per clause}
For example, Φ = (x₁ ∨ x₂) ∧ (x₁ ∨ x̅₃) ∧ (x₂ ∨ x₄) is a Boolean formula and it is in 2CNFSAT. The decision problem 2CNFSAT is
{Φ | Φ is a satisfiable propositional formula in CNF with at most two literals per clause}
For example, Φ = (x₁ ∨ x₂) ∧ (x₁ ∨ x̅₃) ∧ (x₂ ∨ x₄) is a Boolean formula and it is in 2CNFSAT. The decision problem 2CNFSAT is
Correct : b
Similar Questions
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Choose the word that is opposite in meaning to the word “coherent”.
Total Unique Visitors
Loading......