[1]} showed how to find a good seed and analyzed the performance of the rounding using entropy. Recall that for 0-1 random variables \(X\)  and \(Y\) , their entropy, mutual entropy, and conditional entropy are defined as
\(H(X) &:= -\sum _{i \in \lbrace  0, 1 \rbrace } \Pr [X = i] \log \Pr [X = i], \\I(X; Y) &:= \sum _{i, j \in \lbrace  0, 1 \rbrace } \Pr [X = i, Y = j]\log \frac{\Pr [X = i, Y = j]}{\Pr [X = i]\Pr [X = j]}, \\H(X|Y) &:= \sum _{i \in \lbrace  0, 1 \rbrace } \Pr [Y = i] H(X | Y = i).\\\) 
