Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F08%3A00321926" target="_blank" >RIV/67985840:_____/08:00321926 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity
Original language description
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing settings
Czech name
Exponenciální separace kvantové a klasické neinteraktivní vícestranné komunikační složitosti
Czech description
Ukážeme první separaci mezi kvantovou a klasickou mnohostrannou komunikační složitostí
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IAA1019401" target="_blank" >IAA1019401: Theories, proofs and computational complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
23rd Annual IEEE Conference on Computational Complexity
ISBN
978-0-7695-3169-4
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
IEEE Computer Society
Place of publication
Maryland
Event location
College Park
Event date
Jun 23, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000257941800032