Pages that link to "Item:Q5454242"

The following pages link to Lower Bounds for Quantum Communication Complexity (Q5454242):

Displaying 30 items.

• Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
• Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
• Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
• Quantum weakly nondeterministic communication complexity (Q387026) (← links)
• Limits on alternation trading proofs for time-space lower bounds (Q496301) (← links)
• Unbounded-error quantum query complexity (Q638526) (← links)
• The landscape of communication complexity classes (Q1653337) (← links)
• Fourier analysis for probabilistic communication complexity (Q1918947) (← links)
• The hardest halfspace (Q1983325) (← links)
• Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
• Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems (Q2828234) (← links)
• Lower bounds for quantum oblivious transfer (Q2908846) (← links)
• Fooling one-sided quantum protocols (Q2957903) (← links)
• On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
• (Q3633949) (← links)
• Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
• (Q5009530) (← links)
• (Q5088887) (← links)
• A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
• Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
• (Q5158501) (← links)
• Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
• Quantum Multiparty Communication Complexity and Circuit Lower Bounds (Q5425444) (← links)
• A Lower Bound on Entanglement-Assisted Quantum Communication Complexity (Q5428803) (← links)
• Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems (Q5459157) (← links)
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465870) (← links)
• Rectangles are nonnegative juntas (Q5890971) (← links)
• Lower bounds in communication complexity based on factorization norms (Q5902088) (← links)
• Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
• Upper bounds on communication in terms of approximate rank (Q6635689) (← links)