We investigate the computational hardness of the {\sc Connectivity}, the {\sc Strong Connectivity} and the {\sc Broadcast} type of Range Assignment Problems in $\R^2$ and $\R^3$. We present new reductions for the {\sc Connectivity} problem, which are easily adapted to suit the other two problems. All reductions are considerably simpler ... more >>>