Abstract
The original knapsack problem is well known to be NP-complete. In a multidimensional version, one have to decide whether a is in the sumset-sum of a set . In this paper, we are going to investigate a communication complexity problem related to this. We are also going to prove some results about the special case of the multidimensional knapsack problem, when the set is in the form , where is a so-called regular set for every .
Citation
Bence Bakos. Norbert Hegyvári. Máté Pálfy. "On a communication complexity problem in combinatorial number theory." Mosc. J. Comb. Number Theory 10 (4) 297 - 302, 2021. https://doi.org/10.2140/moscow.2021.10.297
Information