54 search results - page 6 / 11 » Quantum Multiparty Communication Complexity and Circuit Lowe... |
76
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
88
Voted
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
ITA
2000
14 years 9 months ago
2000
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
TOC
2008
14 years 9 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
59
Voted
CSFW
2009
IEEE
15 years 4 months ago
2009
IEEE
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...