deletions | additions       diff --git a/subsubsection_Linear_Separability_We_are__.tex b/subsubsection_Linear_Separability_We_are__.tex  index 72dba54..c8056b0 100644  --- a/subsubsection_Linear_Separability_We_are__.tex  +++ b/subsubsection_Linear_Separability_We_are__.tex 
...
\subsubsection{Linear \subsection{Linear  Separability} We are dissuaded from the convex-hull intersection approach by its $\Omega(n \log h)$ complexity. Instead given the low dimensionality we seek to rephrase it as a linear-programming problem.