Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Bassilakis, Andrew"'
The randomized query complexity $R(f)$ of a boolean function $f\colon\{0,1\}^n\to\{0,1\}$ is famously characterized (via Yao's minimax) by the least number of queries needed to distinguish a distribution $D_0$ over $0$-inputs from a distribution $D_1
Externí odkaz:
http://arxiv.org/abs/2002.10654
Publikováno v:
CESifo Forum. Winter2018, Vol. 19 Issue 4, p29-35. 7p.
Publikováno v:
Intereconomics; Sep2018, Vol. 53 Issue 5, p274-280, 7p