Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Super-logarithmic depth lower bounds via direct sum in communication complexity
Mauricio Karchmer
,
Ran Raz
, Avi Wigderson
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
31
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Super-logarithmic depth lower bounds via direct sum in communication complexity'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Communication Complexity
100%
Monotone
100%
Direct Sum
100%
Depth Lower Bound
100%
Communication Difficulties
50%
Boolean Functions
50%
Computer Science
Communication Complexity
100%
Communication Problem
100%
Boolean Function
100%
Mathematics
Boolean Function
100%
Direct Sum
100%