Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Riazanov, Artur, Sofronova, Anastasia, Sokolov, Dmitry, Yuan, Weiqiang
Format:	Preprint
Published:	2025
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/2507.12124