Sign-rank Can Increase under Intersection | 0 | 0.34 | 2021 |
Tight Chang's-Lemma-Type Bounds for Boolean Functions. | 0 | 0.34 | 2021 |
Improved Approximate Degree Bounds For $k$-distinctness. | 0 | 0.34 | 2020 |
Improved Approximate Degree Bounds for k-Distinctness. | 0 | 0.34 | 2020 |
On Parity Decision Trees for Fourier-Sparse Boolean Functions. | 0 | 0.34 | 2020 |
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. | 0 | 0.34 | 2019 |
Approximate degree, secret sharing, and concentration phenomena. | 0 | 0.34 | 2019 |
Lower Bounds for Linear Decision Lists. | 0 | 0.34 | 2019 |
Weights at the Bottom Matter When the Top is Heavy. | 4 | 0.39 | 2017 |
A Lifting Theorem with Applications to Symmetric Functions. | 0 | 0.34 | 2017 |
Dual polynomials and communication complexity of XOR functions. | 1 | 0.36 | 2017 |
Small Error Versus Unbounded Error Protocols in the NOF Model. | 0 | 0.34 | 2016 |