Pages that link to "Item:Q343852"
From MaRDI portal
The following pages link to A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852):
Displaying 11 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- A parallel repetition theorem for entangled projection games (Q2351389) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
