Fractional Covers and Communication Complexity
From MaRDI portal
Recommendations
Cited in
(24)- On covering graphs by complete bipartite subgraphs
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
- Information-theoretic approximations of the nonnegative rank
- Upper bounds on the Boolean rank of Kronecker products
- Probabilistic communication complexity over the reals
- On derandomized composition of Boolean functions
- Prediction from partial information and hindsight, with application to circuit lower bounds
- The rectangle covering number of random Boolean matrices
- Dag-like communication and its applications
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\)
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- A stronger LP bound for formula size lower bounds via clique constraints
- scientific article; zbMATH DE number 1559553 (Why is no real title available?)
- scientific article; zbMATH DE number 2086678 (Why is no real title available?)
- Improved composition theorems for functions and relations
- Lifting Theorems for Equality
- Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
- Breaking the rectangle bound barrier against formula size lower bounds
- Depth-3 circuits for inner product
- Information dissemination via broadcasts in the presence of adversarial noise
- Direct sum theorems from fortification
- Choosing, agreeing, and eliminating in communication complexity
- On convex complexity measures
This page was built for publication: Fractional Covers and Communication Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764345)
