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

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

Latest revision as of 20:17, 19 December 2024

scientific article
Language Label Description Also known as
English
Dimension-free bounds and structural results in communication complexity
scientific article

    Statements

    Dimension-free bounds and structural results in communication complexity (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2023
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references