Discuss complexity of calculation of the Boolean difference of a function of n variables by FFT-like algorithms and through decision diagrams. Illustrate the considerations by the example of functions f1 and f2 defined by the truth-vectors
![103_3fff6366-57cf-47a5-a9dc-358fb0c5ee00.png](https://secure.tutorsglobe.com/CMSImages/103_3fff6366-57cf-47a5-a9dc-358fb0c5ee00.png)
and determine the number of EXOR operations required in FFT-like algorithms and decision diagram methods.