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

Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf. New bounds on the classical and quantum communication complexity of some graph properties. In Deepak D'Souza, Telikepalli Kavitha, Jaikumar Radhakrishnan, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India. Volume 18 of LIPIcs, pages 148-159, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]

Abstract

Abstract is missing.