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

Gábor Ivanyos et al. (2012)

> Home

Details and statistics

DOI: 10.4230/LIPICS.FSTTCS.2012.148

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fsttcs/IvanyosKLSW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/IvanyosKLSW12
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. FSTTCS 2012: 148-159

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.