The following pages link to (Q3636247):
Displayed 8 items.
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- On the parity complexity measures of Boolean functions (Q974756) (← links)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models (Q3010420) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
- Fourier Sparsity of GF(2) Polynomials (Q5740202) (← links)
- Bounds on oblivious multiparty quantum communication complexity (Q6164004) (← links)