Analysis of Nederlof's algorithm for subset sum

06/10/2018

∙

by   Zhengjun Cao, et al.

∙

0

∙

share

In 2017, J. Nederlof proposed an algorithm [Information Processing Letters, 118 (2017), 15-16] for constructing a proof that the number of subsets summing to a particular integer equals a claimed quantity. We remark that the algorithm is flawed because: 1) it is not specified explicitly; 2) the true number of solutions is not properly invoked; 3) the proposed recurrence formula is incorrect.