arXiv Open Access 2021

On a Communication Complexity problem in Combinatorial Number Theory

Bence Bakos Norbert Hegyvári Máté Pálfy

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DM math.CO

Penulis (3)

Bence Bakos

Norbert Hegyvári

Máté Pálfy

Format Sitasi

APA MLA BibTeX

Bakos, B., Hegyvári, N., Pálfy, M. (2021). On a Communication Complexity problem in Combinatorial Number Theory. https://arxiv.org/abs/2103.08174

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2021
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓