Pages that link to "Item:Q2428632"
From MaRDI portal
The following pages link to The unbounded-error communication complexity of symmetric functions (Q2428632):
Displaying 8 items.
- The landscape of communication complexity classes (Q1653337) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- (Q5091179) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
