New bounds on the classical and quantum communication complexity of some graph properties (Q2957488)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New bounds on the classical and quantum communication complexity of some graph properties |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounds on the classical and quantum communication complexity of some graph properties |
scientific article |
Statements
26 January 2017
0 references
graph properties
0 references
communication complexity
0 references
quantum communication
0 references
New bounds on the classical and quantum communication complexity of some graph properties (English)
0 references
0.7730625867843628
0 references
0.7709513902664185
0 references
0.7675468921661377
0 references
0.7611590027809143
0 references
