1.1 --- a/exercises/solutions/sol04.tex	Sun Jun 03 20:13:56 2012 +0200
     1.2 +++ b/exercises/solutions/sol04.tex	Mon Jun 04 05:00:02 2012 +0200
     1.3 @@ -193,5 +193,5 @@
     1.4  
     1.5  Next we initialise the set $S[v_j,a_j]$ with the supported tuples, adjust the counters and move unsupported tuples into $Q$ for each constraint $R_{ij}$ and values $a_i\in D_i$, $a_j\in D_j$, again this takes $\Theta(e\cdot k^2)$ time. We notice that each set $S[v_j,a_j]$ and $Q$ have at most $e\cdot k$ elements, also the counter value for any variable-value pair is $\leq e\cdot k$.
     1.6  
     1.7 -The while loop needs some special treatment, due to limited time I have to skip this part for now.
     1.8 +The while loop needs some special treatment based on the observation that $|S[v_j,a_j]|+|Q|=e\cdot k$ and others. But, due to limited time, I have to skip this part this time.
     1.9  \end{document}