deletions | additions       diff --git a/subsubsection_Linear_Separability_We_are__.tex b/subsubsection_Linear_Separability_We_are__.tex  index 1c9e477..72dba54 100644  --- a/subsubsection_Linear_Separability_We_are__.tex  +++ b/subsubsection_Linear_Separability_We_are__.tex 
...
\sum_i^n \frac{3}{i} O(i) = O(n)  \end{align*}  As in the two-dimensional case, Correctedness of  the run-time is algorithm follows from  the only complicated part fact that:  1) None  of the analysis. lemmas presented in-class we relied upon for correctness were dimension-dependent, and  2) As argued above our linear-programming formulation was entirely equivalent to the problem statement.