Pages that link to "Item:Q1889851"

The following pages link to Towards proving strong direct product theorems (Q1889851):

Displaying 9 items.

• A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
• A discrepancy lower bound for information complexity (Q343867) (← links)
• A strong direct product theorem for quantum query complexity (Q354645) (← links)
• Derandomized parallel repetition theorems for free games (Q371195) (← links)
• Improved direct product theorems for randomized query complexity (Q693002) (← links)
• Simulation theorems via pseudo-random properties (Q2281252) (← links)
• New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
• Upper and Lower Bounds on the Power of Advice (Q2816830) (← links)
• (Q5091781) (← links)