The following pages link to (Q5111383):
Displaying 11 items.
- Some improved bounds on communication complexity via new decomposition of cliques (Q2636816) (← links)
- Streaming and Communication Complexity of Clique Approximation (Q2843271) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- Randomized Communication versus Partition Number (Q4973872) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- (Q5088887) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
- Communication Complexity of Pairs of Graph Families with Applications (Q5111227) (← links)
- Rectangles are nonnegative juntas (Q5890971) (← links)