Pages that link to "Item:Q5495864"
From MaRDI portal
The following pages link to Communication lower bounds using directional derivatives (Q5495864):
Displaying 9 items.
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- The multiparty communication complexity of set disjointness (Q2817790) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)