The following pages link to (Q3549688):
Displaying 8 items.
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- The complexity of quantum disjointness (Q5111229) (← links)
- Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
