Pages that link to "Item:Q5902088"
From MaRDI portal
The following pages link to Lower bounds in communication complexity based on factorization norms (Q5902088):
Displaying 20 items.
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- On a theorem of Razborov (Q445247) (← links)
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- Large violation of Bell inequalities with low entanglement (Q717112) (← links)
- Positive semidefinite rank (Q745689) (← links)
- On convex complexity measures (Q964405) (← links)
- Classical versus quantum communication in XOR games (Q1654152) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- Grothendieck constant is norm of Strassen matrix multiplication tensor (Q2334621) (← links)
- Kolmogorov width and approximate rank (Q2423217) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
- The Communication Complexity of Non-signaling Distributions (Q3182931) (← links)
- Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5090458) (← links)
- Sign rank vs discrepancy (Q5092468) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
