Sciweavers

2 search results - page 1 / 1
» Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials an...
Sort
View
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 1 months 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
TOC
2008
89views more  TOC 2008»
13 years 7 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson