scientific article; zbMATH DE number 7559121
From MaRDI portal
Publication:5090458
DOI10.4230/LIPIcs.STACS.2019.12MaRDI QIDQ5090458
Harry Buhrman, Tom Bannink, Farrokh Labib, Jop Briët, Troy Lee
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1811.11068
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
semidefinite programmingcommunication complexitypseudorandomnessGowers normsnonlocal gamesbounded separations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit lower and upper bounds on the entangled value of multiplayer XOR games
- The inverse conjecture for the Gowers norm over finite fields in low characteristic
- Quantum analogues of the Bell inequalities. The case of two spatially separated domains
- Finite reflection groups and graph norms
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Unbounded violation of tripartite Bell inequalities
- Exponential separation of quantum and classical communication complexity
- Near-optimal algorithms for unique games
- Weak quasi-randomness for uniform hypergraphs
- Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
- Decision Trees and Influences of Variables Over Product Probability Spaces
- Conditional Hardness for Approximate Coloring
- On the power of unique 2-prover 1-round games
- Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement
- Quantum lower bounds by polynomials
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- The Grothendieck Constant is Strictly Smaller than Krivine's Bound
- Lower bounds in communication complexity based on factorization norms
- Graph norms and Sidorenko's conjecture
This page was built for publication:
