No. Title Author Year
1 The Power of One Clean Qubit in Communication Complexity Klauck, Hartmut et al. 2021
2 The Complexity of Quantum Disjointness Klauck, Hartmut 2017
3 Correlation in Hard Distributions in Communication Complexity Bottesch, Ralph Christian et al. 2015
4 Limitations of Convex Programming: Lower Bounds on Extended Formulations and Factorization Ranks (Dagstuhl Seminar 15082) Klauck, Hartmut et al. 2015
5 New Bounds for the Garden-Hose Model Klauck, Hartmut 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 Fooling One-Sided Quantum Protocols Klauck, Hartmut et al. 2013
8 New bounds on the classical and quantum communication complexity of some graph properties Ivanyos, Gábor et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 8

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