Dimension-free bounds and structural results in communication complexity (Q2698435): Difference between revisions

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