Pages that link to "Item:Q5495785"
From MaRDI portal
The following pages link to From information to exact communication (Q5495785):
Displaying 24 items.
- Common information and unique disjointness (Q343843) (← links)
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Direct sum fails for zero-error average communication (Q343859) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Information lower bounds via self-reducibility (Q504999) (← links)
- Communication with endogenous information acquisition (Q893400) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Deterministic communication complexity of set intersection (Q1897354) (← links)
- Trading information complexity for error. II: The case of a large error and the external information complexity (Q2105437) (← links)
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
- Communication complexity with small advantage (Q2182866) (← links)
- Chang's lemma via Pinsker's inequality (Q2279257) (← links)
- On information complexity in the broadcast model (Q2796271) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Trading information complexity for error (Q4568116) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- The communication complexity of the inevitable intersection problem (Q4988302) (← links)
- (Q5090444) (← links)
- (Q5121897) (← links)
- (Q5875509) (← links)
- Information complexity of the AND function in the two-party and multi-party settings (Q5919672) (← links)
- The work of Mark Braverman (Q6200321) (← links)
- Communication and information complexity (Q6200329) (← links)
