![](/sites/default/files/styles/workshop_banner_sm_1x/public/complexity9-01.png.jpg?itok=u_XrqdwP)
Abstract
I survey the knowledge of the complexity of distributions, with a focus on lower bounds and the many open problems. To mention a concrete result, we give an explicit boolean function whose input-output pairs cannot be sampled by AC^0 circuits noticeably better than picking a uniform input and guessing at random the value of the function.