One-way communication complexity of partial XOR functions
From MaRDI portal
Cites work
- A lifting theorem with applications to symmetric functions
- An Optimal Separation of Randomized and Quantum Query Complexity
- Boolean function complexity. Advances and frontiers.
- Communication Complexity
- Communication Complexity
- Dimension-free bounds and structural results in communication complexity
- Efficient quantum protocols for XOR functions
- Exponential separation between quantum communication and logarithm of approximate rank
- Fourier sparsity and dimension
- Fourier sparsity, spectral norm, and the log-rank conjecture
- scientific article; zbMATH DE number 2060183 (Why is no real title available?)
- scientific article; zbMATH DE number 7250148 (Why is no real title available?)
- scientific article; zbMATH DE number 7799591 (Why is no real title available?)
- Lifting Theorems for Equality
- Lifting to parity decision trees via stifling
- Lifting with simple gadgets and applications to circuit and proof complexity
- On the parity complexity measures of Boolean functions
- One-way communication complexity and non-adaptive decision trees
- Quantum log-approximate-rank conjecture is also false
- Quantum versus randomized communication complexity, with efficient players
- Structure of protocols for XOR functions
- Testing Fourier dimensionality and sparsity
- The Log-Approximate-Rank Conjecture Is False
This page was built for publication: One-way communication complexity of partial XOR functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875072)
