For each number $\mathsf{N}=4,5,6,7,8$ of bits, we have generated
the functions according to the method
For each number $\mathsf{N}=4,5,6,7,8$ of bits, we have generated
the functions according to the method
For each $\mathsf{N}$, we have then restricted this evaluation to the function
whose Markov Matrix (issued from Eq.~(\ref{eq:Markov:rairo}))
has the smallest practical mixing time.
For each $\mathsf{N}$, we have then restricted this evaluation to the function
whose Markov Matrix (issued from Eq.~(\ref{eq:Markov:rairo}))
has the smallest practical mixing time.