Pages that link to "Item:Q5096890"
From MaRDI portal
The following pages link to A comparison of two lower bound methods for communication complexity (Q5096890):
Displaying 3 items.
- Correction to: ``Communication complexity with small advantage'' (Q777910) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (Q5741834) (← links)