On a communication complexity problem in combinatorial number theory
From MaRDI portal
Publication:2077279
DOI10.2140/moscow.2021.10.297zbMath1502.11021arXiv2103.08174OpenAlexW3139181651WikidataQ114045340 ScholiaQ114045340MaRDI QIDQ2077279
Bence Bakos, Máté Pálfy, Norbert Hegyvári
Publication date: 24 February 2022
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.08174
Arithmetic combinatorics; higher degree uniformity (11B30) Communication complexity, information complexity (68Q11)
Cites Work
This page was built for publication: On a communication complexity problem in combinatorial number theory