Sciweavers

309 search results - page 1 / 62
» Communication Complexity Lower Bounds by Polynomials
Sort
View
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 3 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 5 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 5 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
TOC
2008
89views more  TOC 2008»
13 years 10 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
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 5 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