No. Title Author Year
1 Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082) Beasley, LeRoy B. et al. 2013
2 Fooling One-Sided Quantum Protocols Klauck, Hartmut et al. 2013
3 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: 3


DROPS-Home | Fulltext Search | Imprint Published by LZI