Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication
By: Artur Riazanov , Anastasia Sofronova , Dmitry Sokolov and more
Potential Business Impact:
Finds why a puzzle has no answer.
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$.
Similar Papers
Learning CNF formulas from uniform random solutions in the local lemma regime
Data Structures and Algorithms
Teaches computers to understand complex logic puzzles.
Equality is Far Weaker than Constant-Cost Communication
Computational Complexity
Makes computers solve problems faster without guessing.
A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
Data Structures and Algorithms
Makes computers share data faster for complex problems.