Zobrazeno 1 - 2
of 2
pro vyhledávání: '"J. Niel de Beaudrap"'
Publikováno v:
Algorithmica. 34:449-461
We obtain the strongest separation between quantum and classical query complexity known to date—specifically, we define a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved exactly in t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c64d5a6d269e1a037477560f32df0573
https://doi.org/10.1007/s00453-002-0978-1
https://doi.org/10.1007/s00453-002-0978-1
Autor:
J. Niel de Beaudrap
Fingerprinting is a technique in communication complexity in which two parties (Alice and Bob) with large data sets send short messages to a third party (a referee), who attempts to compute some function of the larger data sets. For the equality func
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19daa7f919731158e3c80c622f9dd494
