Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Putra, Raymond H."'
Autor:
Ambainis, Andris, Iwama, Kazuo, Kawachi, Akinori, Masuda, Hiroyuki, Putra, Raymond H., Yamashita, Shigeru
The oracle identification problem (OIP) is, given a set $S$ of $M$ Boolean oracles out of $2^{N}$ ones, to determine which oracle in $S$ is the current black-box oracle. We can exploit the information that candidates of the current oracle is restrict
Externí odkaz:
http://arxiv.org/abs/quant-ph/0403056
Our problem is to evaluate a multi-valued Boolean function $F$ through oracle calls. If $F$ is one-to-one and the size of its domain and range is the same, then our problem can be formulated as follows: Given an oracle $f(a,x): \{0,1\}^n\times\{0,1\}
Externí odkaz:
http://arxiv.org/abs/quant-ph/0304131
Publikováno v:
In Theoretical Computer Science 2005 345(2):370-385
Publikováno v:
数理解析研究所講究録. 1325:33-38
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::e374572a880bb98a9c4c864a758507dd
http://hdl.handle.net/2433/43169
http://hdl.handle.net/2433/43169