Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916846240792576 |
|---|---|
| author | Riazanov, Artur Sofronova, Anastasia Sokolov, Dmitry Yuan, Weiqiang |
| author_facet | Riazanov, Artur Sofronova, Anastasia Sokolov, Dmitry Yuan, Weiqiang |
| contents | We show that for a randomly sampled unsatisfiable $O(\log n)$-CNF over $n$ variables the randomized two-party communication cost of finding a clause falsified by the given variable assignment is linear in $n$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_12124 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication Riazanov, Artur Sofronova, Anastasia Sokolov, Dmitry Yuan, Weiqiang Computational Complexity We show that for a randomly sampled unsatisfiable $O(\log n)$-CNF over $n$ variables the randomized two-party communication cost of finding a clause falsified by the given variable assignment is linear in $n$. |
| title | Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2507.12124 |