The following pages link to The Pattern Matrix Method (Q3225179):
Displaying 47 items.
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- The hardest halfspace (Q1983325) (← 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)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- (Q2808527) (← links)
- (Q2816409) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- Structure of Protocols for XOR Functions (Q4605274) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- (Q4612487) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
- (Q5005112) (← links)
- (Q5009530) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- (Q5088887) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- (Q5091179) (← links)
- Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
- Sign rank vs discrepancy (Q5092468) (← links)
- (Q5093405) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← 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)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- Bounds on oblivious multiparty quantum communication complexity (Q6164004) (← links)