Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Separations in Query Complexity"'
Autor:
Ambainis, Andris, Belovs, Aleksandrs
While it is known that there is at most a polynomial separation between quantum query complexity and the polynomial degree for total functions, the precise relationship between the two is not clear for partial functions. In this paper, we demonstrate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80eaf569554b1e7c42d9ed35bda2943c
