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

翻译：最初的 knapsack 问题众所周知是 NP 完成 。 在多维版本中, 一个人必须决定$p\ in\ N ⁇ k$ 是否在一套 $X\ subseteq\ N ⁇ k$ 的总和中。 在本文中, 我们将调查与此相关的通信复杂问题 。