Sciweavers

188
Voted
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
16 years 16 days ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson