Pages that link to "Item:Q5495039"
From MaRDI portal
The following pages link to Information Equals Amortized Communication (Q5495039):
Displaying 17 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← 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)
- Information lower bounds via self-reducibility (Q504999) (← links)
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
- On Slepian-Wolf theorem with interaction (Q1635810) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
- (Q4993274) (← links)
- Information value of two-prover games (Q4993275) (← links)
- Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
- Communication and information complexity (Q6200329) (← links)
