The document discusses the equivalence between sampling problems and search problems in complexity theory. It shows that for any sampling problem S, there exists a corresponding search problem R_S that is equivalent to S. Specifically, R_S can be solved via the same complexity class if and only if S can be solved via the corresponding sampling complexity class. This establishes a reduction from sampling to search problems. The reduction relies on the notion of Kolmogorov complexity to define an appropriate hard search problem R_S corresponding to a given sampling problem S.