Fourier meets möbius: fast subset convolution

Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2007 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07  
We present a fast algorithm for the subset convolution problem: given functions f and g defined on the lattice of subsets of an n-element set N , compute their subset convolution f * g, defined for all S ⊆ N by
doi:10.1145/1250790.1250801 dblp:conf/stoc/BjorklundHKK07 fatcat:hvtaeoesqfdo5hnekpxequsb5e