Pages that link to "Item:Q5501937"
From MaRDI portal
The following pages link to Communication Lower Bounds Using Directional Derivatives (Q5501937):
Displaying 15 items.
- The hardest halfspace (Q1983325) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- (Q4612486) (← links)
- (Q4612487) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- (Q5005112) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5875509) (← links)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)
