Pages that link to "Item:Q5900542"

The following pages link to Lower bounds in communication complexity based on factorization norms (Q5900542):

Displaying 7 items.

• Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
• A generalized Grothendieck inequality and nonlocal correlations that require high entanglement (Q635824) (← links)
• Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
• On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
• The Hilbertian tensor norm and entangled two-prover games (Q5135833) (← links)
• Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
• Grothendieck’s Theorem, past and present (Q5389600) (← links)