Login / Signup

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

Gábor IvanyosHartmut KlauckTroy LeeMiklos SanthaRonald de Wolf
Published in: FSTTCS (2012)
Keyphrases
  • graph properties
  • worst case
  • quantum computation
  • graph theoretic
  • graph theory
  • databases
  • directed graph
  • data mining
  • communication networks