Structure of Communication - Richard M. Karp Distinguished Lecture

Explore the fundamental concepts and structural conjectures underlying efficient communication in computational complexity through this Richard M. Karp Distinguished Lecture delivered by Shachar Lovett from UC San Diego. Delve into the theoretical framework of communication complexity, examining its applications in distributed computing and its connections to various mathematical domains. Investigate the progress made in understanding the structures behind efficient communication for general problems, including the famous log-rank conjecture and its implications for two-player deterministic protocols. Discover the relationships between structural conjectures in communication complexity and other areas of mathematics, such as combinatorics, discrete geometry, algebra, and additive combinatorics. Gain insights into the current state of research and advancements in this field from Lovett, an accomplished associate professor known for his contributions to theoretical computer science and mathematics.