1. Bryant, R. E., Graph-based algorithms for Boolean functions manipulation, IEEE Trans. Computers, Vol. C-35, No. 8(1986), 667–691.
2. Clarke, E. M., McMillan, Zhao, X., Fujita, M., Spectral transforms for extremely large Boolean functions, in: Kebschull, U., Schubert, E., Rosenstiel, W., Eds., Proc. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 16–17. 9. 1993, Hamburg, Germany, 86–90.
3. Nussbaumer, H. J., Fast Fourier Transform and Convolution Algorithms, Springer-Verlag, Berlin, 1981.
4. Burrus, C. S., Eschenbacher, R. W., An in-place, in-order prime factor FFT algorithm, IEEE Trans. Acoust., Speech, Signal Processing, Vol. ASSP-29, No. 1981, 806–816.
5. Butzer, P. L., Stankovic, R. S., Eds., Theory and Applications of Gibbs Derivatives, Matematicki institut, Beograd, 1990.