2000 character limit reached
On a Communication Complexity problem in Combinatorial Number Theory (2103.08174v1)
Published 15 Mar 2021 in cs.DM and math.CO
Abstract: The original knapsack problem is well known to be NP-complete. In a multidimensional version one have to decide whether a $p\in \Nk$ is in a sumset-sum of a set $X \subseteq \Nk$ or not. In this paper we are going to investigate a communication complexity problem related to this.