Analysis of Nederlof's algorithm for subset sum
Data Structures and Algorithms
2018-07-09 v2 Computational Complexity
Abstract
We show that Nederlof's 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 is flawed because: 1) its consistence is not kept; 2) the proposed recurrence formula is incorrect.
Cite
@article{arxiv.1807.02075,
title = {Analysis of Nederlof's algorithm for subset sum},
author = {Zhengjun Cao and Zhen Chen and Lihua Liu},
journal= {arXiv preprint arXiv:1807.02075},
year = {2018}
}
Comments
page 4