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

2012

Presented at the IARCS Annual Conference on the Foundations of Software Technology and Theoretical Computer Science

Additional Metadata
THEME	Life Sciences (theme 5), Logistics (theme 3)
Persistent URL	doi.org/10.4230/LIPIcs.FSTTCS.2012.148
Project	Quantum Computer Science , Quantum computing: fault-tolerance, communication, and classical spin-offs
Conference	IARCS Annual Conference on the Foundations of Software Technology and Theoretical Computer Science
Organisation	Algorithms and Complexity
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Ivanyos, G., Klauck, H., Lee, T., Santha, M., & de Wolf, R. (2012). New bounds on the classical and quantum communication complexity of some graph properties. In Proceedings of FSTTCS 2012 (32) (pp. 148–159). doi:10.4230/LIPIcs.FSTTCS.2012.148

Additional Files
Publisher Version

Publication