Pages that link to "Item:Q579927"
From MaRDI portal
The following pages link to Probabilistic communication complexity (Q579927):
Displaying 14 items.
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- (Q5121902) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
- (Q5158501) (← links)
- Communication complexity: A survey (Q5203681) (← links)
- (Q5228561) (← links)
- Correlation in Hard Distributions in Communication Complexity (Q5351922) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- (Q5875514) (← links)
- Rectangles are nonnegative juntas (Q5890971) (← links)
- LATIN 2004: Theoretical Informatics (Q5901664) (← links)
- Minimum vertex cover, distributed decision-making, and communication complexity (Q6184364) (← links)
- The communication complexity of pointer chasing: applications of entropy and sampling (Q6483601) (← links)
- Upper bounds on communication in terms of approximate rank (Q6635689) (← links)