On algorithm complexity

This paper contains review of the authors' results in the theory of algorithm complexity. The results described concern the methods for obtaining lower bounds (containing almost all exponential lower bounds on monotone complexity of monotone functions), asymptotically optimal functional networks' synthesis, Boolean functions minimization, and the problems of solving Boolean equations.