Dima Grigoriev, Nicolai Vorobjov. Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. In 35th Annual Symposium on Foundations of Computer Science, 20-22 November 1994, Santa Fe, New Mexico, USA. pages 548-552, IEEE, 1994.