From expanders to hitting distributions and simulation theorems
From MaRDI portal
Recommendations
Cites work
- Communication Complexity
- Cumulative space in black-white pebbling and resolution
- Deterministic communication vs. partition number
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Lower bounds for elimination via weak regularity
- Query-to-communication lifting for BPP
- Ramanujan graphs
- Rectangles are nonnegative juntas
- Separation of the monotone NC hierarchy
- Structure of protocols for XOR functions
Cited in
(3)
This page was built for publication: From expanders to hitting distributions and simulation theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005099)