MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Lower Bounds for Quantum Communication Complexity." – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 23 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • A direct product theorem for discrepancy  
  • by Troy Lee, Adi Shraibman — 2008 — In Proceedings of the 23rd IEEE Conference on Computational Complexity. IEEE
  • … showing a Ω( √ n) lower bound on the quantum communication complexity of disjointness, Razborov [Raz03…
  • Cited by 4 (2 self)Add To MetaCart
  • Improved Quantum Communication Complexity  
  • by Bounds For Disjointness
  • …-enhanced quantum communication complexity [13, 28]. In contrast, we show here that the 12 in the above lower bound
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB