Analysis of Nederlof's algorithm for subset sum

06/10/2018
by   Zhengjun Cao, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

research
01/29/2014

Information quantity in a pixel of digital image

The paper is devoted to the problem of integer-valued estimating of info...
research
11/02/2015

On the Number of Many-to-Many Alignments of Multiple Sequences

We count the number of alignments of N > 1 sequences when match-up types...
research
05/24/2021

Efficient Reporting of Top-k Subset Sums

The "Subset Sum problem" is a very well-known NP-complete problem. In th...
research
10/27/2021

Average-Case Subset Balancing Problems

Given a set of n input integers, the Equal Subset Sum problem asks us to...
research
01/11/2022

Approximating Subset Sum Ratio via Subset Sum Computations

We present a new FPTAS for the Subset Sum Ratio problem, which, given a ...
research
01/23/2020

Canonical form of modular hyperbolas with an application to integer factorization

For a composite n and an odd c with c not dividing n, the number of solu...
research
12/28/2018

Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks

In the domain of software watermarking, we have proposed several graph t...

Please sign up or login with your details

Forgot password? Click here to reset