The following pages link to Rectangles Are Nonnegative Juntas (Q5890971):
Displaying 29 items.
- Random oracles and non-uniformity (Q1648794) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Nondeterministic and randomized Boolean hierarchies in communication complexity (Q2041245) (← links)
- Communication complexity with small advantage (Q2182866) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- Unifying presampling via concentration bounds (Q2695631) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
- From Expanders to Hitting Distributions and Simulation Theorems (Q5005099) (← links)
- (Q5009548) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- The Untold Story of $$\mathsf {SBP}$$ (Q5042261) (← links)
- (Q5088887) (← links)
- (Q5089146) (← links)
- Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
- (Q5091755) (← links)
- (Q5092454) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- (Q5140848) (← links)
- (Q5158502) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- (Q5875509) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- (Q6062152) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
