+\begin{itemize}
+ \item Page $255$ states that worst case you need to test all $2^n$
+ configurations. But in practise this almost never is the case. Is this
+ really almost never the case? This is not obvious since is other fields
+ of computer science, such as time complexity the average complexity
+ usually is closer to the maximal complexity than to the minimal
+ complexity.
+ \item Would it be better to research not so much the delta debugging
+ algorithm but the heuristics in searching since different clustering
+ heuristics give significantly different results.
+\end{itemize}