Communication complexity and combinatorial lattice theory

Related Items

The rectangle covering number of random Boolean matrices, Communication complexity and linearly ordered sets, The corruption bound, log-rank, and communication complexity, Non-deterministic communication complexity with few witnesses, Alternation, sparsity and sensitivity: bounds and exponential gaps, On the ``log rank-conjecture in communication complexity, The chromatic number and rank of the complements of the Kasami graphs, Bounds on the number of 2-level polytopes, cones, and configurations, Around the log-rank conjecture, Linear algebraic methods in communication complexity, On order and rank of graphs, Structure of Protocols for XOR Functions, A counterexample to the Alon-Saks-Seymour conjecture and related problems, Unnamed Item, Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract), An Almost Optimal Algorithm for Computing Nonnegative Rank, The communication complexity of enumeration, elimination, and selection, Exponential Lower Bounds for Polytopes in Combinatorial Optimization, Factoring a band matrix over a semiring, Computing a Nonnegative Matrix Factorization---Provably, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

Cites Work