Pages that link to "Item:Q3581283"

The following pages link to Two applications of information complexity (Q3581283):

Displaying 18 items.

• Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
• Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
• A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
• Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
• An information statistics approach to data stream and communication complexity (Q598248) (← links)
• Memory lower bounds for XPath evaluation over XML streams (Q657920) (← links)
• The landscape of communication complexity classes (Q1653337) (← 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)
• Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
• Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
• Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
• Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
• (Q5121896) (← links)
• (Q5121897) (← links)
• Communication Lower Bounds Via the Chromatic Number (Q5458837) (← links)
• Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond (Q6062144) (← links)