![](https://www.pdfsearch.io/img/17695babcbb2f5c691f3047e9d6a52ba.jpg) Date: 2012-12-10 08:58:52
| | New bounds on the classical and quantum communication complexity of some graph properties∗ Gábor Ivanyos1 , Hartmut Klauck2 , Troy Lee3 , Miklos Santha4 , and Ronald de Wolf5 1Add to Reading ListSource URL: drops.dagstuhl.deDownload Document from Source Website File Size: 717,28 KBShare Document on Facebook
|