deletions | additions       diff --git a/f) Size of the input.tex b/f) Size of the input.tex  index 011ad81..313fbcb 100644  --- a/f) Size of the input.tex  +++ b/f) Size of the input.tex 
...
Let $K$ be the set of courses for a particular problem instance $I$. The size of our problem therefore becomes equal to the number of inputs, in our case courses: $\card{K}$.  \subsection{Logarithmic cost criteria}  For each course, we have two attributes which contributes contribute  to the size of our input: a start time and a finish time. This means that in logathimic cost criteria, the problem size for the same problem $I$ would be: \[  \sum_{k \in K}{\Big[ \lfloor \log_2 \verb|start|(k)\rfloor + \lfloor \log_2 \verb|finish|(k)\rfloor \Big]}  \]