On a Communication Complexity problem in Combinatorial Number Theory
Discrete Mathematics
2021-03-16 v1 Combinatorics
Abstract
The original knapsack problem is well known to be NP-complete. In a multidimensional version one have to decide whether a is in a sumset-sum of a set or not. In this paper we are going to investigate a communication complexity problem related to this.
Cite
@article{arxiv.2103.08174,
title = {On a Communication Complexity problem in Combinatorial Number Theory},
author = {Bence Bakos and Norbert Hegyvári and Máté Pálfy},
journal= {arXiv preprint arXiv:2103.08174},
year = {2021}
}