让下一篇重要论文，不再错过。

原文摘要

Can one sampler give every string at least a polynomial fraction of the probability that any source in a class gives it, while keeping a bounded moment of its own runtime? We answer this in terms of runtime moments. For every oracle and every rational $a>0$, one sampler with polynomial $a$th runtime moment dominates every source with polynomial $r$th moment with power $B(a,r)=1+(a-\min\{r,1\})_+/r$, and the Rényi divergence of order $B/(B-1)$ of the source from it is $O(\log n)$, a sharp quantitative form of Gurevich's domination on average. Relative to an oracle, $B(a,r)$ is optimal in both senses, with failures at every large input length. So the first moment is a threshold: one sampler of order one is universal for expected polynomial time, but none of higher order is universal even for polynomial-space sources with all polynomial moments. For expected-polynomial-time sources the threshold also holds relative to a random oracle and, without an oracle, under a sequential-hardness hypothesis on iterated functions or a parallel-sequentiality hypothesis on verifiable delay functions with short seeds. The frontier governs algorithms as well. For rational orders we determine the exact exponent by which polynomial runtime moments of deterministic deciders transfer from one fixed sampler to every source, and show, relative to oracles, that all correct solvers of a sparse language in $\mathsf{UP}\cap\mathsf{coUP}$ meet it. Where $B(a,r)=1$, actual running times transfer better than arbitrary costs, but only above a critical moment.