Quadratically Tight Relations for Randomized Query Complexity | 0 | 0.34 | 2020 |
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. | 0 | 0.34 | 2019 |
A Composition Theorem for Randomized Query Complexity. | 0 | 0.34 | 2018 |
On learning linear functions from subset and its applications in quantum computing. | 0 | 0.34 | 2018 |
Separations in Communication Complexity Using Cheat Sheets and Information Complexity | 7 | 0.50 | 2016 |
Separations in Query Complexity Based on Pointer Functions | 10 | 0.54 | 2015 |
Deciding bisimilarity is P-complete | 45 | 2.41 | 1992 |
On the reversibility of oblivious transfer | 16 | 1.38 | 1991 |
Parallel complexity in the design and analysis of concurrent systems | 18 | 1.77 | 1991 |