Can anybody explain me what it means the following:
$\mathtt{for} \quad \mathbf{p} \quad \mathtt{in} \quad \{\{0, 1\}^k \setminus \mathbf{0}\} \quad \mathtt{do}$
See here https://cseweb.ucsd.edu/~pvoulgar/files/voronoi_full.pdf in Algorithm 3 (pag. 11). I'm trying to implement this on MatLab but I cannot understand that for-loop condition.
Thanks!
$\{ 0,1 \}^k$ is the set of $k$-tuples comprised of $0$s and $1$s. For example with $k=2$ you have $\{ (0,0),(0,1),(1,0),(1,1) \}$. Your for loop would assign p to each of the last three elements (since it excludes the zero vector).