A Fast Algorithm for Subspace ConvolutionResearch Paper
Subset summation asks, given a value for every subset , for all sums . The fast zeta transform does this in additions, and with its inverse, the Möbius transform, it underlies the fastest known algorithms for chromatic number, Hamiltonian path and covering products (Björklund–Husfeldt–Koivisto 2009; Bj…