New bounds on the classical and quantum communication complexity of some graph properties

Ivanyos, Gábor and Klauck, H and Lee, T and Santha, M and de, Wolf (2012) New bounds on the classical and quantum communication complexity of some graph properties. In: Leibniz International Proceedings in Informatics (LIPIcs), 2012-12-15 - 2012-12-17, Hyderabad, India. 10.4230/LIPIcs.FSTTCS.2012.148

[img]
Preview
Text
12.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (734kB) | Preview
Item Type: Conference or Workshop Item (-)
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: EPrints Admin
Date Deposited: 23 Jan 2013 09:02
Last Modified: 05 Feb 2014 12:27
URI: http://eprints.sztaki.hu/id/eprint/6864

Update Item Update Item