Dimension-free bounds and structural results in communication complexity
From MaRDI portal
Publication:2698435
DOI10.1007/s11856-022-2365-8OpenAlexW3164123192MaRDI QIDQ2698435
Pooya Hatami, Hamed Hatami, Lianna Hambardzumyan
Publication date: 24 April 2023
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-022-2365-8
Cites Work
- Unnamed Item
- Unnamed Item
- Idempotents with small norms
- Schur idempotents and hyperreflexivity
- The communication complexity of addition
- A quantitative version of the non-Abelian idempotent theorem
- On the equivalence covering number of splitgraphs
- Eigenvalue bounds for independent sets
- On the parity complexity measures of Boolean functions
- More spectral bounds on the clique and independence numbers
- Covering graphs by the minimum number of equivalence relations
- Private vs. common random bits in communication complexity
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- Some combinatorial-algebraic problems from complexity theory
- A linear lower bound on the unbounded error probabilistic communication complexity.
- A note on 0-1 Schur multipliers
- On the structure of Boolean functions with small spectral norm
- Upper bounds on communication in terms of approximate rank
- Simulation theorems via pseudo-random properties
- Bounds in Cohen's idempotent theorem
- A quantitative version of the idempotent theorem in harmonic analysis
- Norms of idempotent Schur multipliers
- The smallest eigenvalue of \(K_{r}\)-free graphs
- Laplacian spectral bounds for clique and independence numbers of graphs
- Cliques and the spectral radius
- Summary of essential results in the theory of topological tensor products and nuclear spaces.
- The Erdös-Hajnal Conjecture-A Survey
- Graph Energy
- Communication Complexity Theory: Thirty-Five Years of Set Disjointness
- The Hadamard Operator Norm of a Circulant and Applications
- The Pattern Matrix Method
- On a Conjecture of Littlewood and Idempotent Measures
- Lower Bounds in Communication Complexity
- CYCLES AND 1-UNCONDITIONAL MATRICES
- On Graph Complexity
- Covering Graphs by Equivalence Relations
- Mesures ε-idempotentes de norme bornée
- CREW PRAM<scp>s</scp> and Decision Trees
- On the norm of an idempotent Schur multiplier on the Schatten class
- Deterministic Communication vs. Partition Number
- Structure of Protocols for XOR Functions
- On the Ranges of Bimodule Projections
- Communication Complexity
- An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
- Recent advances on the log-rank conjecture in communication complexity
- Equality alone does not simulate randomness
- Query-to-Communication Lifting for BPP
- Analysis of Boolean Functions
- Efficient quantum protocols for XOR functions
- Grothendieck’s Theorem, past and present
- A Lower Bound for Agnostically Learning Disjunctions
- L'algèbre de Fourier d'un groupe localement compact
- Rectangles Are Nonnegative Juntas
- Norms of Schur multipliers
- Lower bounds in communication complexity based on factorization norms
- Log-rank and lifting for AND-functions
This page was built for publication: Dimension-free bounds and structural results in communication complexity
