On the distribution of subset sums of certain sets in \mathbb{Z}^2_p

Abstract: A given subset

A

of natural numbers is said to be complete if every element of

m a t h b b N

is the sum of distinct terms taken from

A

. This topic is strongly connected to the knapsack problem which is known to be NP complete. Interestingly if

A

and

B

are complete sequences then

A i m e s B

is not necessarily complete in

m a t h b b N^{2}

. In this paper we consider a modular version of this problem, motivated by the communication complexity problem of [2].

This page was built for publication: On the distribution of subset sums of certain sets in $\mathbb{Z}^2_p$