New answers tagged coding-theory
3
Note: See the edit at the bottom for an argument showing that there is an unbiased algorithm which has variance strictly lower than $1/12$ for all $x \in [0,1]$.
We can at least prove that if $x$ is chosen uniformly from $[0,1]$, then the average variance must be at least $\pi^2/64 - 1/12$. There is a dithering algorithm that achieves this average-case ...
Top 50 recent answers are included
Related Tags
coding-theory × 105it.information-theory × 27
co.combinatorics × 20
reference-request × 13
ds.algorithms × 11
encoding × 11
cc.complexity-theory × 10
linear-algebra × 7
graph-theory × 6
quantum-computing × 5
algebra × 5
polynomials × 4
cr.crypto-security × 3
pr.probability × 3
upper-bounds × 3
polynomial-hierarchy × 3
pcp × 3
combinatorics × 3
survey × 3
np-hardness × 2
approximation-algorithms × 2
optimization × 2
counting-complexity × 2
linear-programming × 2
big-list × 2