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

Abstract

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$.