No. Title Author Year
1 Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks Buhrman, Harry et al. 2022
2 Memory Compression with Quantum Random-Access Gates Buhrman, Harry et al. 2022
3 A Framework of Quantum Strong Exponential-Time Hypotheses Buhrman, Harry et al. 2021
4 Algebraic Methods in Quantum and Classical Models of Computation (Dagstuhl Seminar 02421) Buhrman, Harry et al. 2021
5 Bounding Quantum-Classical Separations for Classes of Nonlocal Games Bannink, Tom et al. 2019
6 Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication Buhrman, Harry et al. 2017
7 Catalytic Space: Non-determinism and Hierarchy Buhrman, Harry et al. 2016
8 Round Elimination in Exact Communication Complexity Briƫt, Jop et al. 2015
9 On the Parallel Repetition of Multi-Player Games: The No-Signaling Case Buhrman, Harry et al. 2014
10 Learning Parities in the Mistake-Bound model Buhrman, Harry et al. 2010
11 Unconditional Lower Bounds against Advice Buhrman, Harry et al. 2010
12 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity Agrawal, Manindra et al. 2008
13 07411 Executive Summary -- Algebraic Methods in Computational Complexity Agrawal, Manindra et al. 2008
14 High Entropy Random Selection Protocols Vereshchagin, Nikolai K. et al. 2008
15 04421 Abstracts Collection -- Algebraic Methods in Computational Complexity Buhrman, Harry et al. 2005
Current Page :
Number of result pages: 1
Number of documents: 15


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI