Pages that link to "Item:Q1889851"
From MaRDI portal
The following pages link to Towards proving strong direct product theorems (Q1889851):
Displaying 17 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)
- Interactive Information Complexity (Q3454520) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- (Q5091781) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← 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)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)
- Tight characterizations for preprocessing against cryptographic salting (Q6652927) (← links)
