1.

Which of the following logical operation can be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?$

A. Conjunction
B. Disjunction
C. Negation
D. All of the mentioned
Answer» E.


Discussion

No Comment Found