Communication Complexity is NP-hard
Abstract
In the paper where he first defined Communication Complexity, Yao asks: Is computing CC(f) (the 2-way communication complexity of a given function f) NP-complete? The problem of deciding whether CC(f) k, when given the communication matrix for f and a number k, is easily seen to be in NP. Kushilevitz and Weinreb have shown that this problem is cryptographically hard. Here we show it is NP-hard.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.