All reports by Author Gal Arnon:

__
TR21-152
| 8th November 2021
__

Gal Arnon, Tomer Grossman#### Min-Entropic Optimality

Gal Arnon, Tomer Grossman

We introduce the notion of \emph{Min-Entropic Optimality} thereby providing a framework for arguing that a given algorithm computes a function better than any other algorithm. An algorithm is $k(n)$ Min-Entropic Optimal if for every distribution $D$ with min-entropy at least $k(n)$, its expected running time when its input is drawn ... more >>>