diff options
| author | Thibaut Horel <thibaut.horel@gmail.com> | 2013-12-16 23:41:27 -0500 |
|---|---|---|
| committer | Thibaut Horel <thibaut.horel@gmail.com> | 2013-12-16 23:41:27 -0500 |
| commit | bdb3de2c22b35bef10b3c32bd6d091b0cc7833e2 (patch) | |
| tree | 885ac22313afba68d4f1e97e946045e0d27df123 /approximation.tex | |
| parent | 4881402a832d53f56000dab12c460c62a3be3fc3 (diff) | |
| download | recommendation-bdb3de2c22b35bef10b3c32bd6d091b0cc7833e2.tar.gz | |
Latest change
Diffstat (limited to 'approximation.tex')
| -rwxr-xr-x | approximation.tex | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/approximation.tex b/approximation.tex index 87d67d9..2162f14 100755 --- a/approximation.tex +++ b/approximation.tex @@ -146,4 +146,3 @@ The restricted set $\dom_{c,\alpha}$ ensures that the partial derivatives of the $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 can be found in \cite{arxiv}. |