Pages that link to "Item:Q2875134"

The following pages link to A strong direct product theorem for disjointness (Q2875134):

Displaying 24 items.

• Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
• A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
• Direct sum fails for zero-error average communication (Q343859) (← links)
• A discrepancy lower bound for information complexity (Q343867) (← links)
• Improved direct product theorems for randomized query complexity (Q693002) (← links)
• The landscape of communication complexity classes (Q1653337) (← links)
• From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
• Towards proving strong direct product theorems (Q1889851) (← links)
• New strong direct product results in communication complexity (Q2796407) (← links)
• From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back (Q2799090) (← links)
• Upper and lower bounds on the power of advice (Q2816830) (← links)
• The multiparty communication complexity of set disjointness (Q2817790) (← links)
• Interactive Information Complexity (Q3454520) (← links)
• Trading information complexity for error (Q4568116) (← links)
• Interactive Information Complexity (Q4592949) (← links)
• Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
• The complexity of quantum disjointness (Q5111229) (← links)
• A monogamy-of-entanglement game with applications to device-independent quantum cryptography (Q5141579) (← links)
• Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
• (Q5743425) (← links)
• Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
• The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
• (Q5875509) (← links)
• Rectangles are nonnegative juntas (Q5890971) (← links)