On a Communication Complexity problem in Combinatorial Number Theory

03/15/2021

∙

by   Bence Bakos, et al.

∙

0

∙

share

The original knapsack problem is well known to be NP-complete. In a multidimensional version one have to decide whether a p∈^k is in a sumset-sum of a set X ⊆^k or not. In this paper we are going to investigate a communication complexity problem related to this.