deletions | additions       diff --git a/f) Size of the input.tex b/f) Size of the input.tex  index 971bd96..011ad81 100644  --- a/f) Size of the input.tex  +++ b/f) Size of the input.tex 
...
\newcommand{\card}[1]{\left\vert{#1}\right\vert}  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 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: