Contains basic information on the complexity of Boolean functions since the early works of K. Shannon. Includes widely known results of S.V. Yablonsky, O. B. Lupanov, Yu. I. Zhuravlev, E. I. Nechiporuk and recent work on lower estimates of the complexity of Boolean functions. Most attention is paid to the problem of lower difficulty scores.