Pages that link to "Item:Q5117373"
From MaRDI portal
The following pages link to Query-to-Communication Lifting for BPP (Q5117373):
Displaying 12 items.
- Nondeterministic and randomized Boolean hierarchies in communication complexity (Q2041245) (← links)
- Quantum versus randomized communication complexity, with efficient players (Q2099674) (← links)
- Communication complexity with small advantage (Q2182866) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- Structure of Protocols for XOR Functions (Q4605274) (← links)
- From Expanders to Hitting Distributions and Simulation Theorems (Q5005099) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- (Q5140848) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
- Communication lower bounds of key-agreement protocols via density increment arguments (Q6582217) (← links)
