Analysis of Nederlof's algorithm for subset sum
classification
💻 cs.DS
cs.CC
keywords
algorithmnederlofanalysisbecauseclaimedconsistenceconstructingequals
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.