Pages that link to "Item:Q2875133"

The following pages link to How to compress interactive communication (Q2875133):

Displaying 23 items.

• Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
• A discrepancy lower bound for information complexity (Q343867) (← links)
• Information lower bounds via self-reducibility (Q504999) (← links)
• Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
• Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
• The choice and agreement problems of a random function (Q1705694) (← links)
• The direct sum of universal relations (Q1751432) (← links)
• Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
• Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
• New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
• Geometric stability via information theory (Q2826226) (← links)
• The Hardness of Being Private (Q2943893) (← links)
• Relative Discrepancy Does not Separate Information and Communication Complexity (Q3448811) (← links)
• Interactive Information Complexity (Q3454520) (← links)
• Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
• (Q4993274) (← links)
• Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
• (Q5090444) (← links)
• Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
• Lower Bounds for External Memory Integer Sorting via Network Coding (Q5157396) (← links)
• (Q5743415) (← links)
• Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
• Communication lower bounds of key-agreement protocols via density increment arguments (Q6582217) (← links)