No. Title Author Year
1 A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity Gavinsky, Dmitry et al. 2019
2 Bounding Quantum-Classical Separations for Classes of Nonlocal Games Bannink, Tom et al. 2019
3 Two New Results About Quantum Exact Learning Arunachalam, Srinivasan et al. 2019
4 A Composition Theorem for Randomized Query Complexity Anshu, Anurag et al. 2018
5 Strategies for Quantum Races Lee, Troy et al. 2018
6 Separating Quantum Communication and Approximate Rank Anshu, Anurag et al. 2017
7 On the Sum-of-Squares Degree of Symmetric Quadratic Functions Lee, Troy et al. 2016
8 Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082) Klauck, Hartmut et al. 2015
9 The Cover Number of a Matrix and its Algorithmic Applications Alon, Noga et al. 2014
10 Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082) Beasley, LeRoy B. et al. 2013
11 New bounds on the classical and quantum communication complexity of some graph properties Ivanyos, Gábor et al. 2012
12 Approximation norms and duality for communication complexity lower bounds Lee, Troy et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 12


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