# HG changeset patch
# User Eugen Sawin <sawine@me73.com>
# Date 1338778802 -7200
# Node ID c4cbf19866b3ec02e013df121a9627fff4700a18
# Parent  60edc408c19eecae52397c028f0e7faea90b0946
Added final sol04.

diff -r 60edc408c19e -r c4cbf19866b3 exercises/solutions/sol04.pdf
Binary file exercises/solutions/sol04.pdf has changed
diff -r 60edc408c19e -r c4cbf19866b3 exercises/solutions/sol04.tex
--- a/exercises/solutions/sol04.tex	Sun Jun 03 20:13:56 2012 +0200
+++ b/exercises/solutions/sol04.tex	Mon Jun 04 05:00:02 2012 +0200
@@ -193,5 +193,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$.
 
-The while loop needs some special treatment, due to limited time I have to skip this part for now.
+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.
 \end{document}