Pages that link to "Item:Q4605274"
From MaRDI portal
The following pages link to Structure of Protocols for XOR Functions (Q4605274):
Displaying 16 items.
- Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
- Quantum versus randomized communication complexity, with efficient players (Q2099674) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- From Expanders to Hitting Distributions and Simulation Theorems (Q5005099) (← links)
- On the Decision Tree Complexity of Threshold Functions (Q5042240) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← 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 Composition Theorem for Randomized Query Complexity (Q5136299) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5918630) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5925692) (← links)
