| No. | Title | Author | Year |
|---|---|---|---|
| 1 | On Query-To-Communication Lifting for Adversary Bounds | Anshu, Anurag et al. | 2021 |
| 2 | When Is Amplification Necessary for Composition in Randomized Query Complexity? | Ben-David, Shalev et al. | 2020 |
| 3 | Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge | Ben-David, Shalev et al. | 2019 |
| 4 | Low-Sensitivity Functions from Unambiguous Certificates | Ben-David, Shalev et al. | 2017 |
| 5 | Separating Quantum Communication and Approximate Rank | Anshu, Anurag et al. | 2017 |
| 6 | Sculpting Quantum Speedups | Aaronson, Scott et al. | 2016 |
| 7 | The Structure of Promises in Quantum Speedups | Ben-David, Shalev | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |