The following pages link to (Q3633949):
Displaying 24 items.
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- (Q5140844) (← links)
- (Q5158501) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- (Q5875509) (← links)
- (Q5875514) (← links)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)
- Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
