summaryrefslogtreecommitdiffstats
path: root/approximation.tex
diff options
context:
space:
mode:
Diffstat (limited to 'approximation.tex')
-rwxr-xr-xapproximation.tex1
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}.