Pages that link to "Item:Q5415498"

The following pages link to Interactive information complexity (Q5415498):

Displaying 13 items.

• Certifying equality with limited interaction (Q343864) (← links)
• A discrepancy lower bound for information complexity (Q343867) (← links)
• Quantum conditional mutual information and approximate Markov chains (Q500059) (← links)
• Information lower bounds via self-reducibility (Q504999) (← links)
• Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616) (← links)
• Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
• The Hardness of Being Private (Q2943893) (← links)
• Making Randomness Public in Unbounded-Round Information Complexity (Q3194724) (← links)
• Relative Discrepancy Does not Separate Information and Communication Complexity (Q3448811) (← links)
• Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
• Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
• The Communication Complexity of Distributed epsilon-Approximations (Q4978194) (← links)
• (Q4993274) (← links)