diff options
Diffstat (limited to 'approximation.tex')
| -rwxr-xr-x | approximation.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/approximation.tex b/approximation.tex index 901e1dd..dc39e5b 100755 --- a/approximation.tex +++ b/approximation.tex @@ -127,8 +127,8 @@ In other words, $f$ is $\delta$-decreasing if increasing any coordinate by $\del \begin{proposition}\label{prop:monotonicity} For any $\delta\in(0,1]$ and any $\varepsilon\in(0,1]$, - there exists an algorithm computes a $\delta$-decreasing, + there exists an algorithm which computes a $\delta$-decreasing, $\varepsilon$-accurate approximation of $L^*_c$. The running time of the algorithm is $O\big(poly(n, d, \log\log\frac{B}{b\varepsilon\delta})\big)$. \end{proposition} -The proof and the algorithm (Algorithm~\ref{alg:monotone}) are in Appendix~\ref{proofofproprelaxation}. +The proof and the algorithm (Algorithm~\ref{alg:monotone}) are in Appendix~\ref{proofofpropmonotonicity}. |