The following pages link to Communication Complexity (Q4875692):
Displaying 50 items.
- Implausible consequences of superstrong nonlocality (Q269047) (← links)
- Experimental multipartner quantum communication complexity employing just one qubit (Q269058) (← links)
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Direct sum fails for zero-error average communication (Q343859) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- A discrepancy lower bound for information complexity (Q343867) (← links)
- Quantifying communication in synchronized languages (Q344766) (← links)
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Quantum entanglement and the communication complexity of the inner product function (Q387020) (← links)
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Space lower bounds for online pattern matching (Q390881) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- One-round multi-party communication complexity of distinguishing sums (Q391326) (← links)
- Clique versus independent set (Q402465) (← links)
- Biclique covers and partitions (Q405095) (← links)
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- Linear algebraic methods in communication complexity (Q417541) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
- Asking questions (Q485823) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Boosting distinct random sampling for basic counting on the union of distributed streams (Q497679) (← links)
- Distinguishing two probability ensembles with one sample from each ensemble (Q503466) (← links)
- Information lower bounds via self-reducibility (Q504999) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- The communication complexity of addition (Q519955) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- Best-order streaming model (Q534570) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Traced communication complexity of cellular automata (Q549703) (← links)
- Communication complexity in number-conserving and monotone cellular automata (Q551188) (← links)
- Larger lower bounds on the OBDD complexity of integer multiplication (Q553298) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- Multiparty communication complexity and very hard functions (Q598239) (← links)
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- Simulation of equatorial von Neumann measurements on GHZ states using nonlocal resources (Q606121) (← links)
- Communication complexity and intrinsic universality in cellular automata (Q616488) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Distributed averaging on digital erasure networks (Q629058) (← links)
- Memory lower bounds for XPath evaluation over XML streams (Q657920) (← links)
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- The navigational power of web browsers (Q692917) (← links)
