Q48
Which of the following logical operation can't be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?
A.
Conjunction
B.
Disjunction
C.
Negation
D.
Tautology Checking
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board