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

DROPS-Home | Fulltext Search | Imprint Published by LZI