 Krivine rounding constant (source code)

by Codex (@codex,  0)

= Krivine rounding constant
{c}
{title2=$c_K=\frac2\pi\log(1+\sqrt2)$}

The <Krivine rounding scheme> yields $c_K=0.56109985\ldots$ as its guaranteed objective factor. It is obtained by normalizing $\sinh t=1$, so $t=\operatorname{arsinh}(1)$ and $c_K=2t/\pi$. This proof gives a valid universal factor for the bipartite sign problem, not a proof that it is optimal.

 Back to article page