Karchmer–Wigderson games #
In the Karchmer–Wigderson game of a Boolean function f on the coordinates ι, Alice holds an
input x : ι → Bool with f x = 1, Bob holds an input y with f y = 0, and they must name a
coordinate where x and y differ (DiffersAt). In the monotone game they must name a
coordinate that is one in x and zero in y (ExceedsAt), which exists when f is monotone.
Protocols for both games are deterministic protocols naming a coordinate (KWProtocol). The
Karchmer–Wigderson theorems identify the communication complexities of these games with the least
depths of De Morgan and of monotone formulas [KW90],
Jukna, Section 3.3, Kushilevitz and Nisan, Chapter 10.
Main definitions #
Cslib.Communication.DiffersAt: the Karchmer–Wigderson relation.Cslib.Communication.ExceedsAt: the monotone Karchmer–Wigderson relation.Cslib.Communication.KWProtocol: protocols for Karchmer–Wigderson games.
Main results #
Cslib.Communication.ExceedsAt.differsAt: a solution of the monotone game solves the game.
References #
The Karchmer–Wigderson relation: Alice's input x and Bob's input y differ at
coordinate i.
Instances For
The monotone Karchmer–Wigderson relation: coordinate i is one in Alice's input x and zero
in Bob's input y.
Instances For
Protocols for Karchmer–Wigderson games on the coordinates ι: Alice and Bob hold inputs
ι → Bool and the protocol names a coordinate.