Constant-Cost Communication is not Reducible to k-Hamming Distance

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fang, Yuting, Göös, Mika, Harms, Nathaniel, Hatami, Pooya
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2407.20204