scholarly journals Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching

Author(s):  
Marco Molinaro ◽  
David P. Woodruff ◽  
Grigory Yaroslavtsev
1995 ◽  
Vol 5 (3-4) ◽  
pp. 191-204 ◽  
Author(s):  
Mauricio Karchmer ◽  
Ran Raz ◽  
Avi Wigderson

1982 ◽  
Vol 25 (3) ◽  
pp. 296-301 ◽  
Author(s):  
Bruno J. Müller ◽  
S. Tariq Rizvi

AbstractWe prove two theorems on continuous modules:Decomposition Theorem. A continuous moduleMhas a decomposition,M=M1⊕M2, such thatM1is essential over a direct sumof indecomposable summandsAiofM, andM2has no uniform submodules; and these data are uniquely determined byMup to isomorphism.Direct Sum Theorem. A finite direct sumof indecomposable modulesAiis continuous if and only if eachAiis continuous andAj-injective for allj≠ i.


2010 ◽  
Vol 10 (3&4) ◽  
pp. 181-189
Author(s):  
A. Ambainis ◽  
A.M. Childs ◽  
F. Le Gall ◽  
S. Tani

We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced \nand formula. We show that the query complexity is $\tilde\Theta(d^{(k+1)/2})$ for 0-certificates, and $\tilde\Theta(d^{k/2})$ for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is $\tilde O(d^{(k+1)/2})$. Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem.


Sign in / Sign up

Export Citation Format

Share Document