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