Q The Query Complexity Zoo
\(\bar{\mathrm{R}}_{\varepsilon}(f)\)

Expected-cost randomized query complexity

Same as R_eps but the cost is the expected (not worst-case) number of queries.

also written: expected query complexity, average-depth randomized complexity

Definition

$\bar{\mathrm{R}}_\varepsilon(f) = \min_{A} \max_{x\in\mathrm{Dom}(f)} \mathbb{E}[\#\text{queries of }A\text{ on }x]$ over randomized algorithms $A$ that err with probability $\le\varepsilon$ on every $x$.

The distinction from $\mathrm{R}_\varepsilon$ matters:

  • $\bar{\mathrm{R}}_\varepsilon(f) \le \mathrm{R}_\varepsilon(f)$ always;
  • $\mathrm{R}_{\varepsilon'}(f) \le \bar{\mathrm{R}}_\varepsilon(f)/(\varepsilon'-\varepsilon)$ by Markov + truncation, so at constant error they agree up to constants;
  • at $\varepsilon = 1/2 - o(1)$ they can behave very differently, and Yao's question of whether $\bar{\mathrm{R}}_\varepsilon$ has a distributional characterisation has a positive answer for bounded error [Vereshchagin98] and a negative answer in the small-bias regime [BBGM22].

Parameters

Basic facts

  • $\bar{\mathrm{R}}_0(f) = \mathrm{R}_0(f)$: the zero-error measure is by definition an expected-cost measure.
  • Yao (1977) asked for a distributional characterisation of $\bar{\mathrm{R}}_\varepsilon$; resolved positively for constant $\varepsilon$ and negatively for $\varepsilon = 1/2-o(1)$.

Relations to other measures

A row shows what the zoo knows about the two ordered pairs involving \(\bar{\mathrm{R}}_{\varepsilon}(f)\). “\(\bar{\mathrm{R}}_{\varepsilon}(f)\) in terms of it” is the pair with \(\bar{\mathrm{R}}_{\varepsilon}(f)\) on the left (the matrix row); the other column is the reverse. Each cell gives, per setting, the exponent range a,b of the best bounds known — \(\mathrm{M_1} = \Omega(\mathrm{M_2}^{a})\) below and \(\mathrm{M_1} = O(\mathrm{M_2}^{b})\) above, so \(a = b\) means settled — or a glyph where no polynomial bound exists at all. These are derived, not just read off the exponent table, so they are present for pairs the table does not cover. A cell with no entry for a setting is one where the zoo has nothing at that setting, and a — one where the ordered pair is empty in all three; derived marks a direction with no hand-written relation record behind it, which is the common case and not a hole.

Other measure \(\bar{\mathrm{R}}_{\varepsilon}(f)\) in terms of it It in terms of \(\bar{\mathrm{R}}_{\varepsilon}(f)\)
\(\mathrm{R}_{\varepsilon}(f)\) Bounded-error randomized query complexity total1,1 partial1,1 relation1,1 derived open pair → total1,1 partial1,1 relation1,1 open pair →
\(\mathrm{R}_{0}(f)\) Zero-error randomized query complexity total1,1 partial1,1 relation1,1 derived open pair → total2,2 partial∞ relation∞ derived open pair →
\(\mathrm{D}^{\mu}_{\varepsilon}(f)\) Distributional query complexity total1,1 partial1,1 relation1,1 open pair → total1,1 partial1,1 relation1,1 derived open pair →
\(\mathrm{R}^{1}(f)\) One-sided-error randomized query complexity total1,1 partial1,1 derived open pair → total1,2 partial∞ derived open pair →

The 4 above are this entry’s hand-picked neighbours; the other 89 are everything else in the zoo, by category.

Known values

FunctionValueNotes
OR total \(\Theta(n)\) Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with $\mathrm{R}_{\varepsilon}(f) = \Theta(n)$ and $\mathrm{D}(f) = n$ here.
AND total \(\Theta(n)\) Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with $\mathrm{R}_{\varepsilon}(f) = \Theta(n)$ and $\mathrm{D}(f) = n$ here.
PARITY total \(\Theta(n)\) Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with both ends $n$ here.
MAJORITY total \(\Theta(n)\) Same sandwich; expected cost cannot help by more than a constant at constant error.
Threshold total \(\Theta(n)\)
Symmetric functions (general) total \(\Theta(n)\) Sandwiched between $\mathrm{R}_{\varepsilon}(f) = \Theta(n)$ and $\mathrm{D}(f) = n$.
EXACT-HALF total \(\Theta(n)\) Sandwiched: $\widetilde{\deg}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with $\widetilde{\deg}_{\varepsilon}(f) = \Theta(n)$ and $\mathrm{D}(f) = n$ here.
ODD-MAX-BIT total \(\Theta(n)\) Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with $\mathrm{R}_{\varepsilon}(f) = \Theta(n)$ and $\mathrm{D}(f) = n$ here.
ADDRESS / multiplexer total \(\Theta(k+1)\) Sandwiched: $\mathrm{s}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with both ends $k+1$ here.
Binary tree navigation total \(\Theta(k)\) Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with $\mathrm{R}_{\varepsilon}(f) = \Theta(k)$ and $\mathrm{D}(f) = k$ here.
TRIBES total \(\Theta(n)\) Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with $\mathrm{R}_{\varepsilon}(f) = \Theta(n)$ and $\mathrm{D}(f) = n$ here.
AND-OR tree (depth 2) total \(\Theta(n^2)\) Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{R}_{0}(f)$, with both ends $\Theta(n^2)$ here.
NAND tree (balanced AND-OR formula) total \(\Theta\!\big(N^{\,0.753\ldots}\big)\) Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{R}_{0}(f)$, with both ends $\Theta\!\big(N^{\,0.753\ldots}\big)$ here.
Recursive MAJORITY-of-3 total \(\Omega(2.59^{\,d}),\ O(1.007\cdot 2.64944^{\,d})\) Between $\mathrm{R}_{\varepsilon}$ and $\mathrm{R}_0$, whose recorded windows coincide here (the [MNSSTX16] algorithm is zero-error).
Kushilevitz's function (iterated) total \(\Theta(N)\) Sandwiched: $\mathrm{bs}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with both ends $N$ here.
Rubinstein's function total \(\Theta(N)\) Sandwiched: $\mathrm{fbs}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with $\mathrm{fbs}(f) = \Theta(N)$ and $\mathrm{D}(f) = N$ here.
Ambainis-Sun function total \(\Theta(N)\) Sandwiched: $\mathrm{R}_{\varepsilon} \le \bar{\mathrm{R}}_{\varepsilon} \le \mathrm{R}_0$, with both ends $\Theta(N)$ here.
AND composed with NOT-EXACT-HALF total \(\Theta(n^2)\) Sandwiched: $\mathrm{s}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with both ends $\Theta(n^2)$ here.
Meiburg's tournament-subcube function total \(\ge 14011^{\,d}\) putative Between $\mathrm{R}$ and $\mathrm{R}_0$, both $\ge 14011^{\,d}$ here.
Pointer functions total \(\widetilde O(\sqrt n)\) Variant $g_{m,m}$: the distributional/average-case form of $\mathrm{R}$, $\overline{\mathrm{R}}=\Theta(\mathrm{R})=\widetilde O(\sqrt n)$.
Cheat-sheet functions total \(\widetilde\Theta(n)\) The distributional form of $\mathrm{R}$: $\overline{\mathrm{R}}=\Theta(\mathrm{R})=\widetilde\Theta(n)$.
Low-sensitivity function from unambiguous certificates total \(\widetilde\Omega(n^3)\) The distributional form of $\mathrm{R}$: $\overline{\mathrm{R}}=\Theta(\mathrm{R})=\widetilde\Omega(n^3)$.
Unambiguous-DNF / Alon-Saks-Seymour function total \(\widetilde\Omega(n^{4/3})\) The distributional form of $\mathrm{R}$: $\overline{\mathrm{R}}=\Theta(\mathrm{R})=\widetilde\Omega(n^{4/3})$.
Gilmer-Saks-Srinivasan functions total \(\Omega(n)\) The distributional form of $\mathrm{R}$: $\overline{\mathrm{R}}=\Theta(\mathrm{R})=\Omega(n)$.
Goos-Pitassi-Watson partition-number function total \(\widetilde\Omega(\sqrt n)\) The distributional form of $\mathrm{R}$: $\overline{\mathrm{R}}=\Theta(\mathrm{R})=\widetilde\Omega(\sqrt n)$.
Goos-Jayram-Pitassi-Watson function total \(\widetilde\Theta(n^{2/3})\) The distributional form of $\mathrm{R}$: $\overline{\mathrm{R}}=\Theta(\mathrm{R})=\widetilde\Theta(n^{2/3})$.
Ambainis' exact-quantum function total \(\Theta(3^d)\) Squeeze: $\bar{\mathrm{R}}\le\mathrm{R}=3^d$ and $\bar{\mathrm{R}}=\Omega(\mathrm{fbs})=\Omega(3^d)$.
FORRELATION partial \(\widetilde\Theta(\sqrt n)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon}(f) = \widetilde\Theta(\sqrt n)$ here.
k-FORRELATION partial \(\widetilde\Theta\!\big(n^{1-1/k}\big)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon}(f) = \widetilde\Theta(n^{1-1/k})$ here.
Simon's problem partial \(\Theta(2^{n/2})\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon}(f) = \Theta(2^{n/2})$ here.
Deutsch-Jozsa partial \(\Theta(1)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Bernstein-Vazirani partial \(\Theta(n)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Marked bit partial \(\Theta(n)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Dense marked bit partial \(\Theta(1)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Unstructured search (relation) relation \(\Theta(n)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
FIND-1 under a density promise relation \(\Theta(1)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Approximate Hamming weight relation \(\Theta(1)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Correlated-string search relation \(\Theta(\sqrt n)\) $\bar{\mathrm{R}}_\varepsilon = \Theta(\mathrm{R}_\varepsilon)$ at constant $\varepsilon$.
SearchCNF relation \(\Theta(1)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$.
Gap-Majority partial \(\Theta(\min(n, 1/\delta^2))\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Gap-Majority at constant gap partial \(\Theta(1)\) $\bar{\mathrm{R}}_\varepsilon = \Theta(\mathrm{R}_\varepsilon)$ for every $f$.
Parity-labelled FIND-1 partial \(\Theta(1)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Approximate index partial \(\Theta(\sqrt{k\log k}) = \Theta(\sqrt{\log n\,\log\log n})\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon}(f) = \Theta(\sqrt{k\log k}) = \Theta(\sqrt{\log n\,\log\log n})$ here.
Collision problem partial \(\Theta(\sqrt n)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon}(f) = \Theta(\sqrt n)$ here.
Element distinctness total \(\Theta(n)\) Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with $\mathrm{R}_{\varepsilon}(f) = \Theta(n)$ and $\mathrm{D}(f) = n$ here.
Ambainis-Belovs function partial \(\Omega(n^{1/3})\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Ben-David-Kundu total search problems relation \(\widetilde\Omega(\sqrt n)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Yamakawa-Zhandry problem relation \(2^{\Omega(n)}\) $\bar{\mathrm{R}} = \Theta(\mathrm{R})$.
Surjectivity total \(\Theta(n)\) Sandwiched: $\mathrm{s}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with both ends $\Theta(n)$ here. The lower end of this sandwich is itself the zoo's own argument (see the note on $\mathrm{s}$), so this value inherits its status.
$k$-distinctness total \(\Theta(n)\)· Sandwiched: $\mathrm{R}_{\varepsilon}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with $\mathrm{R}_{\varepsilon}(f) = \Theta(n)$ and $\mathrm{D}(f) = n$ here.
Triangle finding total \(\Theta(m^2) = \Theta(n)\) Sandwiched: $\mathrm{s}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{R}_{\varepsilon}(f)$, with both ends $\Theta(m^2) = \Theta(n)$ here.
Recursive Fourier sampling partial \(n^{\Omega(\log n)} \text{ at } \ell = \log n\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), so allowing the classical algorithm to pay only in expectation does not rescue it.
Welded trees relation \(\tilde\Theta(2^{n/2})\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon} = \tilde\Theta(2^{n/2})$ here.
Local search on the hypercube relation \(\Theta(2^{n/2}\sqrt n)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon} = \Theta(2^{n/2}\sqrt n)$ here.
Local search on the grid relation \(\Theta(k^{d/2})\ (d \ge 4)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)).
Fourier fishing relation \(\Omega(N/\log N),\ O(N)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), so the expected-cost model does not escape the bound either.
Ordered search partial \(\Theta(\log n)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon}(f) = \log_2 n - \Theta(1)$ here. The expected-cost version does not beat binary search by more than a constant, unlike the quantum case.
Tseitin search on an expander relation \(\Theta(n)\) Between $\mathrm{R} = \Theta(n)$ and $\mathrm{D} = \Theta(n)$.
Inner product mod 2 total \(\Theta(n)\) Sandwiched: $\mathrm{s}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with both ends $n$ here.
Minsky-Papert one-in-a-box total \(\Theta(m^3) = \Theta(N)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon}(f) = \Theta(m^3) = \Theta(N)$ here.
Sink of a tournament total \(\Theta(m) = \Theta(\sqrt N)\) Sandwiched: $\mathrm{bs}(f) \le \bar{\mathrm{R}}_{\varepsilon}(f) \le \mathrm{D}(f)$, with both ends $\Theta(m) = \Theta(\sqrt N)$ here.
Scorpion graphs total \(\Theta(m)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon}(f) = \Theta(m)$ here.
Graph connectivity total \(\Theta(m^2) = \Theta(N)\) $\bar{\mathrm{R}}_{\varepsilon}(f) = \Theta(\mathrm{R}_{\varepsilon}(f))$ for every $f$ (\(\bar{\mathrm{R}}_{\varepsilon}(f)\) vs \(\mathrm{R}_{\varepsilon}(f)\)), and $\mathrm{R}_{\varepsilon}(f) = \Theta(m^2) = \Theta(N)$ here.